# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
291639 | crossing0ver | Discharging (NOI20_discharging) | C++17 | 838 ms | 9976 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define int long long
#define ll long long
#define fi first
#define se second
#define pii pair<int,int>
#define vi vector<int>
using namespace std;
const int N = 1e6+6;
//ll ans;
int n,arr[N];
main() {
int t = 10;
cin >> n;
int tot = n;
for (int i = 1; i <= n; i++)
cin >> arr[i];
ll ans = 0;
int mx = 0,k = 0,block = 0;
for (int i = 1; i <= n; i++) {
if (tot*mx <= block*arr[i]) {
block = 0;
k += arr[i];
tot = n - i+1;
ans += k;
}
else {
if (mx < arr[i]) {
ans += (arr[i] - mx)*(block);
k += arr[i] - mx;
ans+=k;
mx = arr[i];
}
else ans += k;
}
mx = max(mx,arr[i]);
block++;
}
cout << ans <<'\n';
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |