Submission

Score: 80

User: PIP3_PP

Problemset: Fool's Compensation

Language: cpp

Time: 0.004 second

Submitted On: 2026-03-13 13:49:11

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

int main(){
	unsigned long long n,cnt = 0;
	cin >> n;
	if(n == 0){
	    cout << 0;
	    return 0;
	}
	
	if(n == 1){
	    cout << 1000;
	    return 0;
	}
	vector<unsigned long long> num(n,0),G(n,1000);
	cin >> num[0];
	for(int i = 1 ; i < n ; i++){
		cin >> num[i];
		if(num[i] > num[i-1]) G[i] = G[i-1] + 1000;
	}
	cnt += G[n-1];
	for(int i = n-2 ; i > -1 ; i--){
		if(num[i] > num[i+1]) G[i] = max(G[i] , G[i+1] + 1000);
		cnt += G[i];
	}
	cout << cnt;
}