Submission

PPPPPPPPPP

Score: 100

User: FotoFatTurtle

Problemset: Fool's Compensation

Language: cpp

Time: 0.018 second

Submitted On: 2025-03-22 11:40:45

#include <bits/stdc++.h>
using namespace std;
int main(void)
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    long long num,temp;
    cin>>num;
    vector<long long> v;
    long long nub1=0,nub2=0,dp[num],ans=0,jum;
    for(long long i=0;i<num;i++)
    {
        cin>>temp;
        v.push_back(temp);
    }
    for(long long i=0;i<num;i++)
    {
        nub1=1;
        for(long long j=i;j>0;j--)
        {
            if(v[j]>v[j-1])
            {
                nub1++;
            }
            else if(v[j]<v[j-1])
            {
                break;
            }
        }
        nub2=1;
        for(long long j=i;j<num-1;j++)
        {
            if(v[j]>v[j+1])
            {
                nub2++;
            }
            else if(v[j]<v[j+1])
            {
                break;
            }
        }
        dp[i]=max(nub1,nub2);
        //cout<<dp[i]<<" ";
        ans+=dp[i];
    }
    cout<<ans*1000;
}