#include <bits/stdc++.h>
typedef long long ll;
ll get(int x, int y, int* a, ll* b) {
return ((((x + y) >> 1) - x + 1) - (y - ((x + y) >> 1))) * a[(x + y) >> 1] - (b[(x + y) >> 1] - (x ? b[x - 1] : 0)) + (b[y] - b[(x + y) >> 1]);
}
int besthub(int r, int l, int* x, ll b) {
ll a[r], sum;
a[0] = x[0];
for (int i = 0; i < r; i++) a[i] = a[i - 1] + x[i];
int i = 0, ans = 0;
for (int j = 0; j < r; j++) {
sum = get(i, j, x, a);
while (sum > b) i++, sum = get(i, j, x, a);
ans = std::max(ans, j - i + 1);
}
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
1 ms |
364 KB |
Output is correct |
5 |
Correct |
1 ms |
360 KB |
Output is correct |
6 |
Correct |
1 ms |
364 KB |
Output is correct |
7 |
Correct |
1 ms |
364 KB |
Output is correct |
8 |
Correct |
1 ms |
364 KB |
Output is correct |
9 |
Correct |
1 ms |
384 KB |
Output is correct |
10 |
Correct |
1 ms |
364 KB |
Output is correct |
11 |
Correct |
1 ms |
364 KB |
Output is correct |
12 |
Correct |
1 ms |
364 KB |
Output is correct |
13 |
Correct |
1 ms |
364 KB |
Output is correct |
14 |
Correct |
1 ms |
364 KB |
Output is correct |
15 |
Correct |
1 ms |
364 KB |
Output is correct |
16 |
Correct |
1 ms |
364 KB |
Output is correct |
17 |
Correct |
1 ms |
364 KB |
Output is correct |
18 |
Correct |
1 ms |
364 KB |
Output is correct |
19 |
Correct |
1 ms |
364 KB |
Output is correct |
20 |
Correct |
1 ms |
364 KB |
Output is correct |
21 |
Correct |
1 ms |
364 KB |
Output is correct |
22 |
Correct |
1 ms |
364 KB |
Output is correct |
23 |
Correct |
1 ms |
364 KB |
Output is correct |
24 |
Correct |
2 ms |
364 KB |
Output is correct |
25 |
Correct |
1 ms |
364 KB |
Output is correct |
26 |
Correct |
1 ms |
364 KB |
Output is correct |
27 |
Correct |
1 ms |
364 KB |
Output is correct |
28 |
Correct |
2 ms |
364 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
748 KB |
Output is correct |
2 |
Correct |
3 ms |
748 KB |
Output is correct |
3 |
Correct |
16 ms |
2540 KB |
Output is correct |
4 |
Correct |
20 ms |
2532 KB |
Output is correct |
5 |
Correct |
10 ms |
1260 KB |
Output is correct |
6 |
Correct |
8 ms |
1260 KB |
Output is correct |
7 |
Correct |
15 ms |
2276 KB |
Output is correct |
8 |
Correct |
15 ms |
2284 KB |
Output is correct |
9 |
Correct |
7 ms |
1260 KB |
Output is correct |
10 |
Correct |
9 ms |
1260 KB |
Output is correct |
11 |
Correct |
17 ms |
2540 KB |
Output is correct |
12 |
Correct |
17 ms |
2540 KB |
Output is correct |
13 |
Correct |
8 ms |
1260 KB |
Output is correct |
14 |
Correct |
8 ms |
1388 KB |
Output is correct |
15 |
Correct |
16 ms |
2028 KB |
Output is correct |
16 |
Correct |
13 ms |
2028 KB |
Output is correct |
17 |
Correct |
15 ms |
2284 KB |
Output is correct |
18 |
Correct |
15 ms |
2284 KB |
Output is correct |
19 |
Correct |
17 ms |
2412 KB |
Output is correct |
20 |
Correct |
16 ms |
2416 KB |
Output is correct |