Submission

PPPPPPPPPP

Score: 100

User: Cmoss9

Problemset: Fool's Compensation

Language: cpp

Time: 0.002 second

Submitted On: 2025-03-24 10:08:04

#include <bits/stdc++.h>
using namespace std;
int main () {
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n;
    cin >> n;
    vector<int> sales(n);
    vector<int> comp(n,1000);
    for (int i = 0;i<n;i++) {
        cin >> sales[i];
    }
    for (int i = 1;i<n;i++) {
        if (sales[i] > sales[i-1]) {
            comp[i] = comp[i-1] + 1000;
        } else if (sales[i] == sales[i-1]) {
            comp[i] = comp[i-1];
        }
    }
    for (int i = n-2;i>=0;i--) {
        if (sales[i] > sales[i+1]) {
            comp[i] = max(comp[i],comp[i+1] + 1000);
        } else if (sales[i] == sales[i+1]) {
            comp[i] = comp[i+1];
        }
    }
    long long sum = 0;
    for (int i = 0;i<n;i++) {
        sum += comp[i];
    }
    cout << sum;
}