Submission

PP-------P

Score: 30

User: Nagornz

Problemset: Fool's Compensation

Language: cpp

Time: 0.003 second

Submitted On: 2025-03-14 12:44:05

#include <bits/stdc++.h>
#define int long long
#define double long double
#define pii pair <int,int>
#define tiii tuple <int, int, int>
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define ub(a, b) upper_bound(a.begin(), a.end(), b) - a.begin();
#define lb(a, b) lower_bound(a.begin(), a.end(), b) - a.begin();
#define ve vector
#define graph(a, n) vector <int> a[n];
#define wgraph(a, n) vector <pii> a[n];
#define emb emplace_back
#define em emplace
#define ins insert
#define er erase
#define iShowSpeed cin.tie(NULL)->sync_with_stdio(false)

using namespace std;

template <typename T>
using greater_priority_queue = priority_queue<T, vector<T>, greater<T>>;

const int mod = 1e9 + 7;
const int inf = 1e18;

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int32_t main(){
    iShowSpeed;
    int n; cin >> n;
    vector <int> a(n + 2);
    for (int i = 1; i <= n; i++) cin >> a[i];
    vector <int> dp(n + 2, 1);
    dp[1] = 1;
    for (int i = 2; i <= n; i++) {
        dp[i] = (a[i] > a[i - 1] ? dp[i - 1] + 1 : (a[i] == a[i - 1] ? dp[i - 1] : 1ll));
    }
    for (int i = n - 1; i >= 1; i--) {
        dp[i] = (a[i] > a[i + 1] ? dp[i + 1] + 1 : (a[i] == a[i + 1] ? dp[i + 1] : 1ll));
    }
    int sum = 0;
    for (int i = 1; i <= n; i++) {
        sum += dp[i];
        // cout << dp[i] << "\n";
    }
    sum *= 1000;
    cout << sum;
}