#include "ricehub.h"
#include<cstdio>
int besthub(int R,int L,int *X,long long B)
{
int ch,p,q,h,i;
long long s;
p=0;q=R+1;
while(p!=q-1)
{
h=(p+q)/2;
s=0;
ch=0;
for(i=h/2;i<h;i++)
{
s+=(long long)(X[i]-X[h-1-i]);
}
if(s<=B)ch=1;
for(i=h;i<R&&ch==0;i++)
{
s+=(long long)(X[i]-X[i-h/2]);
s-=(long long)(X[i-h+h/2]-X[i-h]);
if(s<=B)ch=1;
}
if(ch)p=h;
else q=h;
}
return p;
}
# |
결과 |
실행 시간 |
메모리 |
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 |
4 ms |
4988 KB |
Output is correct |
2 |
Correct |
2 ms |
4988 KB |
Output is correct |
3 |
Correct |
16 ms |
4988 KB |
Output is correct |
4 |
Correct |
25 ms |
4988 KB |
Output is correct |
5 |
Correct |
4 ms |
4988 KB |
Output is correct |
6 |
Correct |
11 ms |
4988 KB |
Output is correct |
7 |
Correct |
25 ms |
4988 KB |
Output is correct |
8 |
Correct |
13 ms |
4988 KB |
Output is correct |
9 |
Correct |
9 ms |
4988 KB |
Output is correct |
10 |
Correct |
7 ms |
4988 KB |
Output is correct |
11 |
Correct |
16 ms |
4988 KB |
Output is correct |
12 |
Correct |
19 ms |
4988 KB |
Output is correct |
13 |
Correct |
4 ms |
4988 KB |
Output is correct |
14 |
Correct |
10 ms |
4988 KB |
Output is correct |
15 |
Correct |
0 ms |
4988 KB |
Output is correct |
16 |
Correct |
21 ms |
4988 KB |
Output is correct |
17 |
Correct |
11 ms |
4988 KB |
Output is correct |
18 |
Correct |
17 ms |
4988 KB |
Output is correct |
19 |
Correct |
23 ms |
4988 KB |
Output is correct |
20 |
Correct |
15 ms |
4988 KB |
Output is correct |