#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
int besthub(int R, int L, int X[], long long B) {
int ans = 0;
int l = 0;
int r = 0;
for (int i = 0; i < R; i++) {
r = max(r, i + 1);
if (i > 0) {
B -= 1ll * (X[i] - X[i - 1]) * (i - l);
B += 1ll * (X[i] - X[i - 1]) * (r - i);
}
while (l < i && B < 0) {
B += X[i] - X[l];
l++;
}
while (r < R && B >= X[r] - X[i]) {
B -= X[r] - X[i];
r++;
}
while (r < R && B + X[i] - X[l] >= X[r] - X[i] && X[i] - X[l] >= X[r] - X[i]) {
B += 1ll * X[i] - X[l] - X[r] + X[i];
r++;
l++;
}
ans = max(ans, r - l);
}
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
332 KB |
Output is correct |
2 |
Correct |
3 ms |
332 KB |
Output is correct |
3 |
Correct |
14 ms |
656 KB |
Output is correct |
4 |
Correct |
14 ms |
704 KB |
Output is correct |
5 |
Correct |
6 ms |
460 KB |
Output is correct |
6 |
Correct |
6 ms |
428 KB |
Output is correct |
7 |
Correct |
13 ms |
692 KB |
Output is correct |
8 |
Correct |
12 ms |
604 KB |
Output is correct |
9 |
Correct |
6 ms |
460 KB |
Output is correct |
10 |
Correct |
7 ms |
496 KB |
Output is correct |
11 |
Correct |
14 ms |
588 KB |
Output is correct |
12 |
Correct |
15 ms |
644 KB |
Output is correct |
13 |
Correct |
12 ms |
460 KB |
Output is correct |
14 |
Correct |
8 ms |
420 KB |
Output is correct |
15 |
Correct |
10 ms |
512 KB |
Output is correct |
16 |
Correct |
12 ms |
588 KB |
Output is correct |
17 |
Correct |
12 ms |
588 KB |
Output is correct |
18 |
Correct |
13 ms |
588 KB |
Output is correct |
19 |
Correct |
16 ms |
580 KB |
Output is correct |
20 |
Correct |
14 ms |
620 KB |
Output is correct |