Submission

PPPPPP--P-

Score: 70

User: detectives_conan

Problemset: Fool's Compensation

Language: cpp

Time: 0.002 second

Submitted On: 2025-03-13 19:39:01

/*
    Author : detective conan
    Problem : Fool’s Compensation
    created : 13/03/2025 19:31 UTC+7
*/
#include <bits/stdc++.h>
#define FOR(i, s, t) for(int i = s; i <= t; ++i)
#define rep(i, s, t) for(int i = s; i >= t; --i)
#define HAVE_TESTCASE false
#define DB(n, s) cout << n << s
#define ANS(n, s) DB(n, s)
#define mod (int)(1e9 + 7)
#define sum(a, b) ((a%mod) + (b%mod))%mod
#define mul(a, b) ((a%mod) * (b%mod))%mod
#define conan cin.tie(nullptr)->sync_with_stdio(false)

using namespace std;

const int MAX_N = 10010;
int a[MAX_N], n, dpl[MAX_N], dpr[MAX_N], ans;

void solve(){
    cin >> n;
    FOR(i, 1, n) cin >> a[i];
    dpl[1] = 1000, dpr[n] = 1000;
    FOR(i, 2, n){
        if(a[i] > a[i - 1]) dpl[i] = dpl[i - 1] + 1000;
        else if(a[i] == a[i - 1]) dpl[i] = dpl[i - 1];
        else dpl[i] = 1000;
    }
    rep(i, n - 1, 1){
        if(a[i] > a[i + 1]) dpr[i] = dpr[i + 1] + 1000;
        else if(a[i] == a[i + 1]) dpr[i] = dpr[i + 1];
        else dpr[i] = 1000;
    }
    FOR(i, 1, n) ans += max(dpr[i], dpl[i]);
    ANS(ans, '\n');
}

int main(){
    conan;
    int t = 1;
    if(HAVE_TESTCASE) cin >> t;
    while(t--) solve();
}