Submission

PPPPPPPPPP

Score: 100

User: osensunny

Problemset: Fool's Compensation

Language: cpp

Time: 0.002 second

Submitted On: 2025-03-20 15:10:48

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

#define ll long long

ll N, sum, rate[10005];
vector<int> dp(10005, 1);

int main(){
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	
	cin >> N;
	for(int i=1; i<=N; i++) cin >> rate[i];
	
	for(int i=2; i<=N; i++){
		if(rate[i] > rate[i-1]) dp[i] = dp[i-1] + 1;
		else if(rate[i] == rate[i-1]) dp[i] = dp[i-1];
	}
	
	for(int i=N-1; i>=1; i--){
		if(rate[i] > rate[i+1]) dp[i] = max(dp[i], dp[i+1] + 1);
		else if(rate[i] == rate[i+1]) dp[i] = max(dp[i], dp[i+1]);
	}
	
	for(int i=1; i<=N; i++) sum += dp[i];
	
	cout << sum*1000;
	
	return 0;
}
/*
10
3 3 3 3 3 3 3 2 1 0
*/