int besthub(int N, int L, int *X, long long B)
{
int A = 0; long long S = 0;
for (int i=0,j=0;j<N;){
for (S+=X[j++]-X[(i+j)/2];S>B;S-=X[(i+j)/2]-X[i++]);
if (A < j - i) A = j - i;
}
return A;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
4992 KB |
Output is correct |
2 |
Correct |
0 ms |
4992 KB |
Output is correct |
3 |
Correct |
0 ms |
4992 KB |
Output is correct |
4 |
Correct |
0 ms |
4992 KB |
Output is correct |
5 |
Correct |
0 ms |
4992 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
4992 KB |
Output is correct |
2 |
Correct |
0 ms |
4992 KB |
Output is correct |
3 |
Correct |
0 ms |
4992 KB |
Output is correct |
4 |
Correct |
0 ms |
4992 KB |
Output is correct |
5 |
Correct |
0 ms |
4992 KB |
Output is correct |
6 |
Correct |
0 ms |
4992 KB |
Output is correct |
7 |
Correct |
0 ms |
4992 KB |
Output is correct |
8 |
Correct |
0 ms |
4992 KB |
Output is correct |
9 |
Correct |
0 ms |
4992 KB |
Output is correct |
10 |
Correct |
0 ms |
4992 KB |
Output is correct |
11 |
Correct |
0 ms |
4992 KB |
Output is correct |
12 |
Correct |
0 ms |
4992 KB |
Output is correct |
13 |
Correct |
0 ms |
4992 KB |
Output is correct |
14 |
Correct |
0 ms |
4992 KB |
Output is correct |
15 |
Correct |
0 ms |
4992 KB |
Output is correct |
16 |
Correct |
0 ms |
4992 KB |
Output is correct |
17 |
Correct |
0 ms |
4992 KB |
Output is correct |
18 |
Correct |
0 ms |
4992 KB |
Output is correct |
19 |
Correct |
0 ms |
4992 KB |
Output is correct |
20 |
Correct |
0 ms |
4992 KB |
Output is correct |
21 |
Correct |
0 ms |
4992 KB |
Output is correct |
22 |
Correct |
0 ms |
4992 KB |
Output is correct |
23 |
Correct |
0 ms |
4992 KB |
Output is correct |
24 |
Correct |
0 ms |
4992 KB |
Output is correct |
25 |
Correct |
0 ms |
4992 KB |
Output is correct |
26 |
Correct |
0 ms |
4992 KB |
Output is correct |
27 |
Correct |
0 ms |
4992 KB |
Output is correct |
28 |
Correct |
0 ms |
4992 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
4992 KB |
Output is correct |
2 |
Correct |
0 ms |
4992 KB |
Output is correct |
3 |
Correct |
0 ms |
4992 KB |
Output is correct |
4 |
Correct |
0 ms |
4992 KB |
Output is correct |
5 |
Correct |
0 ms |
4992 KB |
Output is correct |
6 |
Correct |
0 ms |
4992 KB |
Output is correct |
7 |
Correct |
0 ms |
4992 KB |
Output is correct |
8 |
Correct |
0 ms |
4992 KB |
Output is correct |
9 |
Correct |
0 ms |
4992 KB |
Output is correct |
10 |
Correct |
0 ms |
4992 KB |
Output is correct |
11 |
Correct |
0 ms |
4992 KB |
Output is correct |
12 |
Correct |
0 ms |
4992 KB |
Output is correct |
13 |
Correct |
0 ms |
4992 KB |
Output is correct |
14 |
Correct |
0 ms |
4992 KB |
Output is correct |
15 |
Correct |
0 ms |
4992 KB |
Output is correct |
16 |
Correct |
0 ms |
4992 KB |
Output is correct |
17 |
Correct |
0 ms |
4992 KB |
Output is correct |
18 |
Correct |
0 ms |
4992 KB |
Output is correct |
19 |
Correct |
0 ms |
4992 KB |
Output is correct |
20 |
Correct |
0 ms |
4992 KB |
Output is correct |
21 |
Correct |
0 ms |
4992 KB |
Output is correct |
22 |
Correct |
0 ms |
4992 KB |
Output is correct |
23 |
Correct |
0 ms |
4992 KB |
Output is correct |
24 |
Correct |
0 ms |
4992 KB |
Output is correct |
25 |
Correct |
0 ms |
4992 KB |
Output is correct |
26 |
Correct |
0 ms |
4992 KB |
Output is correct |
27 |
Correct |
0 ms |
4992 KB |
Output is correct |
28 |
Correct |
0 ms |
4992 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
4992 KB |
Output is correct |
2 |
Correct |
4 ms |
4992 KB |
Output is correct |
3 |
Correct |
24 ms |
4992 KB |
Output is correct |
4 |
Correct |
16 ms |
4992 KB |
Output is correct |
5 |
Correct |
8 ms |
4992 KB |
Output is correct |
6 |
Correct |
4 ms |
4992 KB |
Output is correct |
7 |
Correct |
12 ms |
4992 KB |
Output is correct |
8 |
Correct |
16 ms |
4992 KB |
Output is correct |
9 |
Correct |
8 ms |
4992 KB |
Output is correct |
10 |
Correct |
8 ms |
4992 KB |
Output is correct |
11 |
Correct |
16 ms |
4992 KB |
Output is correct |
12 |
Correct |
20 ms |
4992 KB |
Output is correct |
13 |
Correct |
4 ms |
4992 KB |
Output is correct |
14 |
Correct |
0 ms |
4992 KB |
Output is correct |
15 |
Correct |
8 ms |
4992 KB |
Output is correct |
16 |
Correct |
12 ms |
4992 KB |
Output is correct |
17 |
Correct |
16 ms |
4992 KB |
Output is correct |
18 |
Correct |
8 ms |
4992 KB |
Output is correct |
19 |
Correct |
12 ms |
4992 KB |
Output is correct |
20 |
Correct |
20 ms |
4992 KB |
Output is correct |