Submission

PP-P--PP-P

Score: 60

User: ngngdi

Problemset: Fool's Compensation

Language: cpp

Time: 0.002 second

Submitted On: 2025-03-19 09:01:06

#include<bits/stdc++.h>
using namespace std;
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n,a;
    cin>>n;
    vector<int> v;
    vector<int> b(n,1);
    long long int total=0;
    for(int i=0;i<n;i++){
        cin>>a;
        v.push_back(a);
    }
    for(int i=1;i<n;i++){
        if(v[i]>v[i-1])
        b[i]=b[i-1]+1;
        else if(v[i]==v[i-1])
        b[i]=b[i-1];
    }
    for(int j=n-2;j>=0;j--){
        if(v[j]>v[j+1])
        b[j]=b[j+1]+1;
        else if(v[j]==v[j+1])
        b[j]=b[j+1];
    }
    for(int i=0;i<n;i++){
        total += b[i];
    }
    cout<<total*1000;
}