Submission

Score: 100

User: Chayatoeyy

Problemset: Fool's Compensation

Language: cpp

Time: 0.003 second

Submitted On: 2026-03-14 08:59:33

#include<bits/stdc++.h>
using namespace std;
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    long long n;
    cin >> n;
    long long a[n];
    for(int i=0;i<n;i++){
        cin >> a[i];
    }
    vector<long long> pay(n,1000);
    for(int i=1;i<n;i++){
        if(a[i]>a[i-1]){
            pay[i] = pay[i-1]+1000;
        }else if(a[i]==a[i-1]){
            pay[i]=pay[i-1];
        }
    }
    for(int i=n-2;i>=0;i--){
        if(a[i]>a[i+1]){
            pay[i] = max(pay[i], pay[i+1] + 1000);
        }else if(a[i]==a[i+1]){
            pay[i] = max(pay[i], pay[i+1]);
        }
    }
    long long total=0;
    for(long long i:pay){
        total+=i;
    }
    cout << total;
}