Submission

Score: 100

User: tHeNyXs

Problemset: Fool's Compensation

Language: cpp

Time: 0.003 second

Submitted On: 2026-03-06 10:43:56

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios_base::sync_with_stdio(false); 
    cin.tie(nullptr);

    int n; 
    cin >> n;

    vector<int> a(n+2,0);
    for(int i=1;i<=n;i++) cin>>a[i];

    vector<int> ic(n+2,1000);

    for(int i=2;i<=n;i++){
        if(a[i] > a[i-1])
            ic[i] = ic[i-1] + 1000;
        else if(a[i] == a[i-1])
            ic[i] = ic[i-1];
    }

    for(int i=n-1;i>=1;i--){
        if(a[i] > a[i+1])
            ic[i] = max(ic[i], ic[i+1] + 1000);
        else if(a[i] == a[i+1])
            ic[i] = ic[i+1];
    }

    long long sum = 0;
    for(int i=1;i<=n;i++) sum += ic[i];

    cout << sum;

    return 0;
}