Submission

PPPPPPPPPP

Score: 100

User: hmmm

Problemset: Fool's Compensation

Language: cpp

Time: 0.022 second

Submitted On: 2025-03-13 12:06:19

#include<bits/stdc++.h>
using namespace std;
const int N=1e4+5;
int dp[N],a[N];

int main(){
	ios::sync_with_stdio(0); cin.tie(0);
	int n;
	cin >> n;
	for(int i=1;i<=n;i++) cin >> a[i];
	for(int i=1;i<=n;i++){
		int cnt=0;
		for(int j=i+1;j<=n;j++){
			if(a[j]<a[j-1]) cnt++;
			else if(a[j]==a[j-1]) cnt+=0;
			else break;
		}
		dp[i]=cnt;
	}
	for(int i=n;i>0;i--){	
		int cnt=0;
		for(int j=i;j>1;j--){
			if(a[j]>a[j-1]) cnt++;
			else if(a[j]==a[j-1]) cnt+=0;
			else break;
		}
		dp[i]=max(dp[i],cnt);
	}
	long long int sum=0;
	for(int i=1;i<=n;i++){
		sum+=dp[i]+1;
//		cout << dp[i]+1 << ' ';
	}
	cout << sum*1000;
}