Submission

Score: 100

User: havename

Problemset: Fool's Compensation

Language: cpp

Time: 0.006 second

Submitted On: 2026-03-05 11:51:44

#include<bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin>>n;
    vector<int> pay(n,1000);
    vector<int> peo(n);
    for(int i=0;i<n;i++) cin>>peo[i];

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

    for(int i=n-2;i>=0;i--){
        if(peo[i]>peo[i+1]){
            pay[i]=max(pay[i],pay[i+1]+1000);
        }
        else if(peo[i]==peo[i+1]){
            pay[i]=max(pay[i],pay[i+1]);
        }
    }
    /*for(int i=0;i<n;i++){
        cout<<peo[i]<<" "<<pay[i]<<"\n";
    }*/
    long long sum=0;
    for(int i=0;i<n;i++){
        sum=sum+pay[i];
    }
    cout<<sum;
}