Submission

Score: 20

User: erng

Problemset: Fool's Compensation

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-05 11:43:04

#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;
    for (int i=idx-1; i>=1; i--)
    {
        if (arr[i]==arr[i+1]) cu=cu;
        else if (arr[i]<arr[i+1]) cu--;
        else cu++;
        ans+=cu;
    }
    cu=1;
    for (int i=idx+1; i<=n; i++)
    {
        if (arr[i]==arr[i-1]) cu=cu;
        else if (arr[i]<arr[i-1]) cu--;
        else cu++;
        ans+=cu;
    }
    ans++;
    cout<<ans*1000;

    /*
4
20
25
5
1

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