Submission

Score: 70

User: purihorharin

Problemset: Fool's Compensation

Language: c

Time: 0.002 second

Submitted On: 2026-03-21 09:11:39

#include <stdio.h>
#include <limits.h>

long long wrks[10000];
long long fcps[10000];
int n;

int work (i) {
    return (i < 0 || i >= n) ? INT_MAX : wrks[i];
}

int max(int a, int b) {
    return (a > b) ? a : b;
}

int main () {
    scanf("%d", &n);

    for (int i = 0; i < n; i++) {
        scanf("%d", wrks+i);
        fcps[i] = 1;
    }
    for (int i = 1; i < n; i++) {
        if (wrks[i] > wrks[i-1]) fcps[i] = fcps[i-1]+1;
        else if (wrks[i] == wrks[i-1]) fcps[i] = fcps[i-1];
    }
    for (int i = n-2; i >= 0; i--) {
        if (wrks[i] > wrks[i+1] && fcps[i] <= fcps[i+1]) fcps[i] = fcps[i+1]+1;
        else if (wrks[i] == wrks[i+1]) fcps[i] = fcps[i+1];
    }
    long long sum = 0;
    for (int i = 0; i < n; i++) {
        sum += fcps[i];
    }
    printf("%d", sum * 1000);
}