Submission

Score: 20

User: Kx

Problemset: Fool's Compensation

Language: cpp

Time: 0.003 second

Submitted On: 2026-03-18 16:39:33

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n; cin >> n;
    vector<int> p(n), m(n, 1000);

    for(int i = 0; i < n; ++i) {cin >> p[i];}

    for(int i = n - 1; i >= 1; --i) {
        if(p[i - 1] > p[i]) {
            m[i - 1] += m[i];
        } else if(p[i - 1] == p[i]){
            m[i - 1] = m[i];
        } else {
            m[i - 1] = 1000;
        }
    }

    if(p[n - 1] > p[n - 2]) {m[n - 1] += 1000;}

    int res = 0;
    for(auto x : m) {
        res += x;
    }

    cout << res;

    return 0;
}