#include <bits/stdc++.h>
using namespace std;
const int mx = 1e6 + 5;
int n, k, A[mx], ans; vector<int> range[mx]; vector<int> stk;
int main(){
cin >> n >> k;
for (int i = 1; i <= n; i++){
cin >> A[i];
while (!stk.empty() and A[stk.back()] <= A[i]) stk.pop_back();
stk.push_back(i);
}
for (int i = 1; i <= n; i++){
int mxTop = 0;
while (!stk.empty()){
int L = stk.back();
if (L < i) range[i - L - 1].push_back(min(A[L], A[i]) - mxTop);
else range[n - (L - i + 1)].push_back(min(A[L], A[i]) - mxTop);
if (A[L] > A[i]) break;
mxTop = max(mxTop, A[L]); stk.pop_back();
}
stk.push_back(i);
}
for (long long len = 1; len <= n; len++){
for (int lim : range[len]){
if (len * lim >= k) ans += 2 * (k / len), k = 0;
else ans += 2 * lim, k -= len * lim;
}
}
cout<<ans<<endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
12 ms |
23756 KB |
Output is correct |
2 |
Correct |
12 ms |
23756 KB |
Output is correct |
3 |
Correct |
16 ms |
23756 KB |
Output is correct |
4 |
Correct |
14 ms |
23756 KB |
Output is correct |
5 |
Correct |
13 ms |
23756 KB |
Output is correct |
6 |
Correct |
12 ms |
23784 KB |
Output is correct |
7 |
Correct |
12 ms |
23668 KB |
Output is correct |
8 |
Correct |
14 ms |
23780 KB |
Output is correct |
9 |
Correct |
12 ms |
23756 KB |
Output is correct |
10 |
Correct |
51 ms |
27584 KB |
Output is correct |
11 |
Correct |
53 ms |
25156 KB |
Output is correct |
12 |
Correct |
53 ms |
27680 KB |
Output is correct |
13 |
Correct |
500 ms |
65536 KB |
Output is correct |
14 |
Correct |
437 ms |
65536 KB |
Output is correct |
15 |
Correct |
388 ms |
65536 KB |
Output is correct |
16 |
Correct |
421 ms |
65536 KB |
Output is correct |
17 |
Correct |
542 ms |
65536 KB |
Output is correct |
18 |
Correct |
426 ms |
65536 KB |
Output is correct |
19 |
Correct |
430 ms |
65536 KB |
Output is correct |
20 |
Correct |
308 ms |
47368 KB |
Output is correct |