Submission #370033

#TimeUsernameProblemLanguageResultExecution timeMemory
370033danielcm585Discharging (NOI20_discharging)C++14
11 / 100
140 ms8300 KiB
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second

typedef long long ll;
typedef pair<int,int> ii;

const int N = 1e6;
int n;
ll t[N+2], h[N+2];

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> t[i];
    }
    cout << t[1]*n << '\n';
    // stack<ll> st;
    // st.push(0);
    ll ans = 0, maxi = 0, ls = 0;
    for (int i = 1; i <= n; i++) {
        if (t[i] > maxi) {
            // int cost = t[i]*(n-i+1);
            // while (!st.empty() && (t[i]-t[st.top()])*(n-st.top()+1) < cost) {
            //     cost = (t[i]-t[st.top()])*(n-st.top()+1);
            //     st.pop();
            // }
            // ans += cost;
            // st.push(i);
            if (ls && (t[i]-t[ls])*(n-ls+1) < t[i]*(n-i+1)) ans += (t[i]-t[ls])*(n-ls+1);
            else {
                ans += t[i]*(n-i+1);
                ls = i;
            }
            maxi = t[i];
        }
    }
    // cout << ans << '\n';
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...