Submission

PPPPPP--P-

Score: 70

User: Nozomi_boundfortokyo

Problemset: Fool's Compensation

Language: cpp

Time: 0.005 second

Submitted On: 2025-03-21 16:49:43

#include <iostream>
using namespace std;
long long rate[10001];
long long dp[10001];

int main()
{
	int n;
	cin>>n;
	for(int i=0;i<n;i++)
	{
		cin>>rate[i];
	}
	for(int i=0;i<n;i++)
	{
		dp[i]=1;
	}
	for(int i=1;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-2;i>=0;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]);
		}
	}
	int sum=0;
	for(int i=0;i<n;i++)
	{
		sum+=1000*dp[i];
	}
	cout<<sum;
}