Submission

P-P-------

Score: 20

User: qwerty

Problemset: Fool's Compensation

Language: cpp

Time: 0.003 second

Submitted On: 2025-03-16 20:02:08

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

void check(int mid, int next, vector<int> &sell, vector<int> &price) {
    if (sell[next]>sell[mid]) price[next]=price[mid]+1000;
    else if (sell[next]==sell[mid]) price[next] = price[mid];
}

int main() {
    int n;
    cin >> n;
    vector<int> sell(n);
    int minn = INT_MAX, mid;
    for (int i = 0 ; i < n ; i++) {
        cin >> sell[i];
        if (sell[i]<minn) {
            minn = sell[i];
            mid = i;
        }
    }

    vector<int> mon(n, 1000);
    int temp = mid;
    int next = mid;
    while (mid < n) {
        next++;
        check(mid, next, sell, mon);
        mid++;
    }
    int next1 = temp;
    while (temp>0) {
        next1--;
        check(temp, next1, sell, mon);
        temp--;
    }

    int ans = 0;
    for (auto i : mon) {
        ans+=i;
    }
    cout << ans;
}