Submission
Status:
PP-P--PP-P
Subtask/Task Score:
60/100
Score: 60
User: sulinx
Problemset: Fool's Compensation
Language: cpp
Time: 0.002 second
Submitted On: 2026-03-11 22:05:02
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<ll> sale(n);
vector<ll> com(n,1000);
for(int i = 0;i<n;i++){
cin >> sale[i];
}
for(int i = 1;i<n;i++){
if(sale[i] > sale[i-1]){
com[i] = com[i-1] + 1000;
}else if(sale[i] == sale[i-1]){
com[i] = com[i-1];
}
}
for(int i = n-2;i>=0;i--){
if(sale[i] > sale[i+1]){
com[i] = com[i+1] + 1000;
}else if(sale[i] == sale[i+1]){
com[i] = com[i+1];
}
}
for(int i = 1;i<n;i++){
com[0] += com[i];
}cout << com[0];
}