Submission

PPPPPPPPPP

Score: 100

User: MiyaZaki1072

Problemset: Fool's Compensation

Language: cpp

Time: 0.002 second

Submitted On: 2025-04-18 17:06:28

#include <bits/stdc++.h>
using namespace std;
#define int long long
int a[10100],giv[10100];
signed main(){
    cin.tie(0)->sync_with_stdio(0);
    int n;cin>>n;
    for(int i=1;i<=n;i++){
        giv[i]=1000;
        cin>>a[i];
        if(a[i] > a[i-1])giv[i] = giv[i-1]+1000;
        else if(a[i] == a[i-1])giv[i] = giv[i-1];
    }//correcting money in the left side
    for(int i=n-1;i>0;i--){//correcting money in the right side
        if(a[i] > a[i+1])giv[i] = max(giv[i],giv[i+1]+1000);
        else if(a[i] == a[i+1])giv[i]=giv[i+1];
    }
    int ans = 0;
    for(int i=1;i<=n;i++)ans+=giv[i];
    cout<<ans;
}