Submission
Status:
PP-P--PP-P
Subtask/Task Score:
60/100
Score: 60
User: faofao
Problemset: Fool's Compensation
Language: cpp
Time: 0.034 second
Submitted On: 2026-03-15 12:32:24
#include <bits/stdc++.h>
using namespace std;
#define int long long
vector<int> v ;
signed main(){
ios::sync_with_stdio(0),cin.tie(0) ;
int n ; cin >> n;
for(int i=0 ; i<n ; i++){
int x ; cin >> x ;
v.push_back(x) ;
}
vector<int> money(n+2,0) ;
money[0] = 1 ;
int sum=0 ;
for(int i=1 ; i<n ; i++){
if(v[i] > v[i-1]) money[i] = money[i-1]+1 ;
else if(v[i]==v[i-1]) money[i] = money[i-1] ;
else if(v[i]<v[i-1]){
money[i] = money[i-1] - 1;
if(money[i]==0){
int j=i ;
while(v[j] <= v[j-1]){
money[j]++ ;
j--;
if(j==0) break;
}
money[j]++ ;
}
}
}
for(int i=0 ; i<n ; i++){
// cout << money[i] << " " ;
sum+=money[i] ;
}
// cout << "\n" ;
cout << sum*1000 ;
}