Submission

PP--------

Score: 20

User: Dormon

Problemset: Fool's Compensation

Language: cpp

Time: 0.002 second

Submitted On: 2025-03-14 13:53:58

#include <iostream>
#include <cstdint>
#include <cstring>
#include <vector>
#include <algorithm>
#include <functional>
#include <queue>
#include <numeric>
#include <array>
#include <iomanip> // cout << fixed << setprecision(n);

using namespace std;
const bool TEST_CASE = 0;

template<typename T>
typename std::enable_if<std::is_integral<T>::value>::type
Debug(const char* name, T value) {
    std::cout << name << " : " << value << '\n';
}

template<typename T, typename... Args>
typename std::enable_if<std::is_integral<T>::value>::type
Debug(const char* names, T value, Args... args){
    const char* comma = strchr(names, ',');
    std::cout.write(names, comma - names) << " : " << value << " | ";
    Debug(comma + 1, args...);
}
template<typename T> 
ostream& operator<<(ostream& out, vector<T> &a){
    for (auto &x : a) out << x << ' '; 
    return out;
};

#ifdef DORMON
    #define debug(...) Debug(#__VA_ARGS__, __VA_ARGS__)
#else
    #define debug(...) 
#endif

void solve(){
    int n;
    cin >> n;
    vector<int> v(n + 2), d(n + 2);

    for (int i = 1;i <= n;i++)
        cin >> v[i];

    d[1] = 1;
    d[n] = 1;
    for (int i = 1;i <= n;i++)
        if (v[i] > v[i - 1])
            d[i] = d[i - 1] + 1;
        else if (v[i] == v[i - 1])
            d[i] = d[i - 1];
        else
            d[i] = 1;

    for (int i = n - 1;i >= 1;i--)
        if (v[i] > v[i + 1])
            d[i] = max(d[i], d[i + 1] + 1);
        else if (v[i] == v[i + 1])
            d[i] = d[i + 1];
        else 
            d[i] = 1;
    // cout << d << '\n';
    cout << accumulate(d.begin(), d.end(), 0) * 1000 << '\n';
}

int main()
{
    #ifndef DORMON
        ios_base::sync_with_stdio(false); 
    #endif
    cin.tie(0);
    int q = 1; 
    if (TEST_CASE) cin >> q;
    while (q--){
        solve();
    }
}