Submission

Score: 100

User: konthaina_TH

Problemset: Fool's Compensation

Language: cpp

Time: 0.004 second

Submitted On: 2026-03-04 19:40:19

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

int main() {
    int n;
    if (!(cin >> n)) return 0;
    vector<int> num(n);
    for (int i = 0; i < n; i++) cin >> num[i];
    vector<int> pay(n, 1000);
    for (int i = 1; i < n; i++) {
        if (num[i] > num[i - 1]) {
            pay[i] = pay[i - 1] + 1000;
        } else if (num[i] == num[i - 1]) {
            pay[i] = pay[i - 1]; 
        }
    }
    for (int i = n - 2; i >= 0; i--) {
        if (num[i] > num[i + 1]) {
            pay[i] = max(pay[i], pay[i + 1] + 1000);
        } else if (num[i] == num[i + 1]) {
            pay[i] = max(pay[i], pay[i + 1]);
        }
    }
    long long total = 0;
    for (int i = 0; i < n; i++) {
        total += pay[i];
    }
    cout << total << endl;

    return 0;
}