#include "ricehub.h"
#include <stdlib.h>
int besthub(int R, int L, int X[], long long B)
{
int i, j, left=1, mid, right=R, x, ok, ans;
long long hab;
while(left<=right)
{
mid=(left+right)/2;
x=(mid-1)/2;
hab=ok=0;
for(i=0 ; i<mid ; i++)
hab+=abs((long long)X[x]-(long long)X[i]);
if(hab<=B)
ok=1;
for(i=1 ; i<=R-mid ; i++)
{
j=i+mid-1;
if(mid%2)
hab-=(long long)X[x++]-(long long)X[i-1];
else
hab-=(long long)X[++x]-(long long)X[i-1];
hab+=(long long)X[j]-(long long)X[x];
if(hab<=B)
ok=1;
}
if(ok)
{
left=mid+1;
ans=mid;
}
else
right=mid-1;
}
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
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 |
20 ms |
4992 KB |
Output is correct |
4 |
Correct |
20 ms |
4992 KB |
Output is correct |
5 |
Correct |
8 ms |
4992 KB |
Output is correct |
6 |
Correct |
8 ms |
4992 KB |
Output is correct |
7 |
Correct |
16 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 |
4 ms |
4992 KB |
Output is correct |
11 |
Correct |
20 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 |
4 ms |
4992 KB |
Output is correct |
15 |
Correct |
16 ms |
4992 KB |
Output is correct |
16 |
Correct |
16 ms |
4992 KB |
Output is correct |
17 |
Correct |
28 ms |
4992 KB |
Output is correct |
18 |
Correct |
16 ms |
4992 KB |
Output is correct |
19 |
Correct |
16 ms |
4992 KB |
Output is correct |
20 |
Correct |
20 ms |
4992 KB |
Output is correct |