Submission

Score: 100

User: navysrimuang

Problemset: Fool's Compensation

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-16 18:49:46

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

int mn = 1;

int main(){
	cin.tie(0)->sync_with_stdio(0);
	int n;
	cin >> n;
	vector<int> v(n),r(n,1);
	for(int i = 0;i<n;i++) cin >> v[i];
	
	for(int i = 1;i<n;i++){
		if(v[i] == v[i-1]) r[i] = r[i-1];
		else if(v[i] > v[i-1]) r[i] = r[i-1] + 1;
		else r[i] = 1;
	}

	for(int i = n-2;i>=0;i--){
		if(v[i] > v[i+1]) r[i] = max(r[i],r[i+1]+1);
		else if (v[i] == v[i+1]) r[i] = max(r[i],r[i+1]);
		//else handeld
	}

	ll sum = 0;
	for(int x : r) sum += x;
	//for(int x : r) cout << x << " ";
	cout << sum*1000 << "\n";
	return 0;
}