Submission

Score: 60

User: erng

Problemset: Fool's Compensation

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-08 16:11:14

#include <bits/stdc++.h>

using namespace std;

#define ll long long

const ll nx=1e4+5;

ll n, arr[nx], mn=LLONG_MAX, idx, cu, ans, cnt[nx];

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    for (int i=1; i<=n; i++)
    {
        cin>>arr[i];
        if (arr[i]<mn)
        {
            mn=arr[i];
            idx=i;
        }
    }
    cu=1;
    cnt[idx]=1;
    arr[0]=4e18;
    arr[n+1]=4e18;
    for (int i=idx-1; i>=1; i--)
    {
        if (arr[i]<arr[i+1] && arr[i]<arr[i-1]) cnt[i]=1;
        else if (arr[i]==arr[i+1]) cnt[i]=cnt[i+1];
        else if (arr[i]<arr[i+1]) cnt[i]=cnt[i+1]-1;
        else cnt[i]=cnt[i+1]+1;
    }
    for (int i=idx+1; i<=n; i++)
    {
        if (arr[i]<arr[i+1] && arr[i]<arr[i-1]) cnt[i]=1;
        else if (arr[i]==arr[i-1]) cnt[i]=cnt[i-1];
        else if (arr[i]<arr[i-1]) cnt[i]=cnt[i-1]-1;
        else cnt[i]=cnt[i-1]+1;
    }
    for (int i=1; i<=n; i++) ans+=cnt[i];
    cout<<ans*1000;

    /*
4
20
25
5
1
    */

/*
10
3
3
3
3
3
3
3
2
1
0
*/
}