#include "ricehub.h"
#define MAX(a,b) ((a)>(b)?(a):(b))
int besthub(int R, int L, int X[], long long B)
{
int maxn=1;
int j=0;
long long cursum=0;
for(int i=0;i<R;i++){
for(j++;j<R;j++){
if(cursum+(long long)(X[j]-X[(i+j)/2])>B){j--;break;}
cursum+=(long long)(X[j]-X[(i+j)/2]);
}
if(j>=R)j=R-1;
maxn=MAX(maxn,j-i+1);
cursum-=(long long)(X[(i+j+1)/2]-X[i]);
}
return maxn;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
4988 KB |
Output is correct |
2 |
Correct |
0 ms |
4988 KB |
Output is correct |
3 |
Correct |
0 ms |
4988 KB |
Output is correct |
4 |
Correct |
0 ms |
4988 KB |
Output is correct |
5 |
Correct |
0 ms |
4988 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
4988 KB |
Output is correct |
2 |
Correct |
0 ms |
4988 KB |
Output is correct |
3 |
Correct |
0 ms |
4988 KB |
Output is correct |
4 |
Correct |
0 ms |
4988 KB |
Output is correct |
5 |
Correct |
0 ms |
4988 KB |
Output is correct |
6 |
Correct |
0 ms |
4988 KB |
Output is correct |
7 |
Correct |
0 ms |
4988 KB |
Output is correct |
8 |
Correct |
0 ms |
4988 KB |
Output is correct |
9 |
Correct |
0 ms |
4988 KB |
Output is correct |
10 |
Correct |
0 ms |
4988 KB |
Output is correct |
11 |
Correct |
0 ms |
4988 KB |
Output is correct |
12 |
Correct |
0 ms |
4988 KB |
Output is correct |
13 |
Correct |
0 ms |
4988 KB |
Output is correct |
14 |
Correct |
0 ms |
4988 KB |
Output is correct |
15 |
Correct |
0 ms |
4988 KB |
Output is correct |
16 |
Correct |
0 ms |
4988 KB |
Output is correct |
17 |
Correct |
0 ms |
4988 KB |
Output is correct |
18 |
Correct |
0 ms |
4988 KB |
Output is correct |
19 |
Correct |
0 ms |
4988 KB |
Output is correct |
20 |
Correct |
0 ms |
4988 KB |
Output is correct |
21 |
Correct |
0 ms |
4988 KB |
Output is correct |
22 |
Correct |
0 ms |
4988 KB |
Output is correct |
23 |
Correct |
0 ms |
4988 KB |
Output is correct |
24 |
Correct |
0 ms |
4988 KB |
Output is correct |
25 |
Correct |
0 ms |
4988 KB |
Output is correct |
26 |
Correct |
0 ms |
4988 KB |
Output is correct |
27 |
Correct |
0 ms |
4988 KB |
Output is correct |
28 |
Correct |
0 ms |
4988 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
4988 KB |
Output is correct |
2 |
Correct |
0 ms |
4988 KB |
Output is correct |
3 |
Correct |
0 ms |
4988 KB |
Output is correct |
4 |
Correct |
0 ms |
4988 KB |
Output is correct |
5 |
Correct |
0 ms |
4988 KB |
Output is correct |
6 |
Correct |
0 ms |
4988 KB |
Output is correct |
7 |
Correct |
0 ms |
4988 KB |
Output is correct |
8 |
Correct |
0 ms |
4988 KB |
Output is correct |
9 |
Correct |
0 ms |
4988 KB |
Output is correct |
10 |
Correct |
0 ms |
4988 KB |
Output is correct |
11 |
Correct |
0 ms |
4988 KB |
Output is correct |
12 |
Correct |
0 ms |
4988 KB |
Output is correct |
13 |
Correct |
0 ms |
4988 KB |
Output is correct |
14 |
Correct |
0 ms |
4988 KB |
Output is correct |
15 |
Correct |
0 ms |
4988 KB |
Output is correct |
16 |
Correct |
0 ms |
4988 KB |
Output is correct |
17 |
Correct |
0 ms |
4988 KB |
Output is correct |
18 |
Correct |
0 ms |
4988 KB |
Output is correct |
19 |
Correct |
0 ms |
4988 KB |
Output is correct |
20 |
Correct |
0 ms |
4988 KB |
Output is correct |
21 |
Correct |
0 ms |
4988 KB |
Output is correct |
22 |
Correct |
0 ms |
4988 KB |
Output is correct |
23 |
Correct |
0 ms |
4988 KB |
Output is correct |
24 |
Correct |
0 ms |
4988 KB |
Output is correct |
25 |
Correct |
0 ms |
4988 KB |
Output is correct |
26 |
Correct |
0 ms |
4988 KB |
Output is correct |
27 |
Correct |
0 ms |
4988 KB |
Output is correct |
28 |
Correct |
0 ms |
4988 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
4988 KB |
Output is correct |
2 |
Correct |
0 ms |
4988 KB |
Output is correct |
3 |
Correct |
21 ms |
4988 KB |
Output is correct |
4 |
Correct |
14 ms |
4988 KB |
Output is correct |
5 |
Correct |
8 ms |
4988 KB |
Output is correct |
6 |
Correct |
5 ms |
4988 KB |
Output is correct |
7 |
Correct |
0 ms |
4988 KB |
Output is correct |
8 |
Correct |
0 ms |
4988 KB |
Output is correct |
9 |
Correct |
7 ms |
4988 KB |
Output is correct |
10 |
Correct |
4 ms |
4988 KB |
Output is correct |
11 |
Correct |
22 ms |
4988 KB |
Output is correct |
12 |
Correct |
24 ms |
4988 KB |
Output is correct |
13 |
Correct |
9 ms |
4988 KB |
Output is correct |
14 |
Correct |
0 ms |
4988 KB |
Output is correct |
15 |
Correct |
17 ms |
4988 KB |
Output is correct |
16 |
Correct |
6 ms |
4988 KB |
Output is correct |
17 |
Correct |
0 ms |
4988 KB |
Output is correct |
18 |
Correct |
11 ms |
4988 KB |
Output is correct |
19 |
Correct |
7 ms |
4988 KB |
Output is correct |
20 |
Correct |
22 ms |
4988 KB |
Output is correct |