Submission #370028

#TimeUsernameProblemLanguageResultExecution timeMemory
370028danielcm585Discharging (NOI20_discharging)C++14
11 / 100
126 ms18028 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]; } stack<ll> st; ll ans = 0, maxi = 0, ls = 0; for (int i = 1; i <= n; i++) { if (t[i] > maxi) { // cout << i << " -> " << (t[i]-t[ls])*(n-ls+1) << ' ' << t[i]*(n-i+1) << '\n'; if (ls && (t[i]-t[ls])*(n-ls+1) < t[i]*(n-i+1)) { ans += (t[i]-t[ls])*(n-ls+1); t[ls] = t[i]; } 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...