Submission

PP-P------

Score: 30

User: Nakornrat

Problemset: Fool's Compensation

Language: cpp

Time: 0.035 second

Submitted On: 2025-03-23 11:34:00

#include <bits/stdc++.h>
using namespace std;
#define endl '\n';
int main()
{
    ios::sync_with_stdio(false);cin.tie(0);
    int n;cin>>n;
    vector<int> dp(n);
    vector<int> a(n);
    for(int i=0;i<n;i++)cin>>a[i];
    dp[0] = 1000;
    int sum = 0;
    for(int i=0;i<n;i++){
        if(i>0){
            if(a[i]>a[i-1]){
                dp[i] = dp[i-1]+1000;
            }else if(a[i]<a[i-1]){
                dp[i] = dp[i-1]-1000;
                if(dp[i]==0){
                    dp[i]+=1000;
                    dp[i-1]+=1000;
                    int idx = i-1;
                    while(idx-1>=0&&a[idx]<=a[idx-1]){
                        if(a[idx]==a[idx-1])dp[idx-1]=dp[idx];
                        else{
                            if(dp[idx-1]>dp[idx])break;
                            dp[idx-1] = dp[idx]+1000;
                        }
                        --idx;
                    }
                    
                }
            }else{
                dp[i] = dp[i-1];
            }
        }
    }
    for(int x:dp){
        sum+=x;
    }
    cout<<sum;
    
}