Submission

Score: 50

User: faofao

Problemset: Fool's Compensation

Language: cpp

Time: 0.003 second

Submitted On: 2026-03-15 12:29:55

#include <bits/stdc++.h>
using namespace std;
#define ll long long

vector<int> v ;

signed main(){
    ios::sync_with_stdio(0),cin.tie(0) ;
    int n ; cin >> n; 
    for(int i=0 ; i<n ; i++){
        int x ; cin >> x ;
        v.push_back(x) ;
    }
    vector<int> money(n,1) ;

    int sum=0 ;
    for(int i=1 ; i<n ; i++){
        if(v[i] > v[i-1]) money[i] = money[i-1]+1 ;
    }
    for(int i=n-2 ; i>=0 ; i--){
        if(v[i] > v[i+1]) money[i] = max(money[i] , money[i+1] +1) ;
    }
    for(int i=0 ; i<n ; i++){
        // cout << money[i] << " " ;
        sum+=money[i] ;
    }
    // cout << "\n" ;
    cout << sum*1000 ;
}