Submission

PPPPPPPPPP

Score: 100

User: fluke

Problemset: Fool's Compensation

Language: cpp

Time: 0.003 second

Submitted On: 2025-03-17 08:36:23

#include <bits/stdc++.h>
#define ll long long 
#define f first
#define s second 
#define pii pair<int,int>
#define piii pair<int,pii>
#define emb emplace_back
#define em emplace
#define all(x) x.begin(),x.end()
#define DB cout<<"\n";system("pause");
using namespace std;
int main(){
ios::sync_with_stdio(false);cin.tie(0);
    int n;
    cin>>n;
    vector <int> ans(n,1000);
    vector <int> time(n);

    for(int i=0;i<n;i++)cin>>time[i];

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

    for(int i=n-2;i>=0;i--){
        if(time[i] > time[i+1])ans[i] = max(ans[i] , ans[i+1]+1000);
        else if(time[i] == time[i+1])ans[i] = ans[i+1];
    }

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

    ll sum = 0;
    for(int i=0;i<n;i++){
        sum += ans[i];
    }
    cout<<sum;
}