Submission

PP-P------

Score: 30

User: FotoFatTurtle

Problemset: Fool's Compensation

Language: cpp

Time: 0.017 second

Submitted On: 2025-03-22 11:29:07

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