Submission

Score: 0

User: Kittiponn

Problemset: Fool's Compensation

Language: cpp

Time: 0.004 second

Submitted On: 2026-03-04 09:34:40

#include <bits/stdc++.h>
#define ll long long
#define sp << ' ' <<
#define nl << '\n' 
#define cnl cout << '\n'
using namespace std;
const int nx = 1e5+5;
const int INF = 1e9+5;
const int MOD = 1e9+7;



int main(){
    cin.tie(0)->sync_with_stdio(0);
    int n;
    cin >> n;
    vector<int> mp(n+5);
    for(int i = 1;i <= n;i++){
        int x;cin >> x;
        mp[i] = x;
    }
    vector<int> ans(n+5,1000);
    for(int i = 2;i <= n;i++){
        if(mp[i] > mp[i-1])ans[i] = ans[i-1] + 1000;
        else if(mp[i] == mp[i-1])ans[i] = ans[i-1];
    }
    for(int i = n;i >= 1;i--){
        if(mp[i] > mp[i+1]){
            ans[i] = max(ans[i],ans[i+1]+1000);
        }
        else if(mp[i] == mp[i+1])ans[i] = ans[i+1];
    }
    ll aa = 0;
    for(int i = 1;i <= n;i++){
        cout << ans[i] << ' ';
        aa += ans[i];
    }
    cout << aa;
}