#include "ricehub.h"
long long s,e,sum[100005],x[100005],mx;
inline long long max(long long X,long long Y) {
return X>Y?X:Y;
}
long long calc(int X,int Y) {
long long k=(Y-X+1)/2;
return sum[Y]-sum[Y-k]-sum[X+k-1]+sum[X-1];
}
int besthub(int R, int L, int X[], long long B)
{
int i;
for(i=0;i<R;i++) {
x[i+1]=X[i];
sum[i+1]=sum[i]+x[i+1];
}
s=1; e=1;
while(s<=R && e<=R) {
if(calc(s,e)<=B) {
mx=max(mx,e-s+1);
e++;
}
else {
s++;
}
}
return mx;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
6552 KB |
Output is correct |
2 |
Correct |
0 ms |
6552 KB |
Output is correct |
3 |
Correct |
0 ms |
6552 KB |
Output is correct |
4 |
Correct |
0 ms |
6552 KB |
Output is correct |
5 |
Correct |
0 ms |
6552 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
6552 KB |
Output is correct |
2 |
Correct |
0 ms |
6552 KB |
Output is correct |
3 |
Correct |
0 ms |
6552 KB |
Output is correct |
4 |
Correct |
0 ms |
6552 KB |
Output is correct |
5 |
Correct |
0 ms |
6552 KB |
Output is correct |
6 |
Correct |
0 ms |
6552 KB |
Output is correct |
7 |
Correct |
0 ms |
6552 KB |
Output is correct |
8 |
Correct |
0 ms |
6552 KB |
Output is correct |
9 |
Correct |
0 ms |
6552 KB |
Output is correct |
10 |
Correct |
0 ms |
6552 KB |
Output is correct |
11 |
Correct |
0 ms |
6552 KB |
Output is correct |
12 |
Correct |
0 ms |
6552 KB |
Output is correct |
13 |
Correct |
0 ms |
6552 KB |
Output is correct |
14 |
Correct |
0 ms |
6552 KB |
Output is correct |
15 |
Correct |
0 ms |
6552 KB |
Output is correct |
16 |
Correct |
0 ms |
6552 KB |
Output is correct |
17 |
Correct |
0 ms |
6552 KB |
Output is correct |
18 |
Correct |
0 ms |
6552 KB |
Output is correct |
19 |
Correct |
0 ms |
6552 KB |
Output is correct |
20 |
Correct |
0 ms |
6552 KB |
Output is correct |
21 |
Correct |
0 ms |
6552 KB |
Output is correct |
22 |
Correct |
0 ms |
6552 KB |
Output is correct |
23 |
Correct |
0 ms |
6552 KB |
Output is correct |
24 |
Correct |
0 ms |
6552 KB |
Output is correct |
25 |
Correct |
0 ms |
6552 KB |
Output is correct |
26 |
Correct |
0 ms |
6552 KB |
Output is correct |
27 |
Correct |
0 ms |
6552 KB |
Output is correct |
28 |
Correct |
0 ms |
6552 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
6552 KB |
Output is correct |
2 |
Correct |
0 ms |
6552 KB |
Output is correct |
3 |
Correct |
0 ms |
6552 KB |
Output is correct |
4 |
Correct |
0 ms |
6552 KB |
Output is correct |
5 |
Correct |
0 ms |
6552 KB |
Output is correct |
6 |
Correct |
0 ms |
6552 KB |
Output is correct |
7 |
Correct |
0 ms |
6552 KB |
Output is correct |
8 |
Correct |
0 ms |
6552 KB |
Output is correct |
9 |
Correct |
0 ms |
6552 KB |
Output is correct |
10 |
Correct |
0 ms |
6552 KB |
Output is correct |
11 |
Correct |
0 ms |
6552 KB |
Output is correct |
12 |
Correct |
0 ms |
6552 KB |
Output is correct |
13 |
Correct |
0 ms |
6552 KB |
Output is correct |
14 |
Correct |
0 ms |
6552 KB |
Output is correct |
15 |
Correct |
0 ms |
6552 KB |
Output is correct |
16 |
Correct |
0 ms |
6552 KB |
Output is correct |
17 |
Correct |
0 ms |
6552 KB |
Output is correct |
18 |
Correct |
0 ms |
6552 KB |
Output is correct |
19 |
Correct |
0 ms |
6552 KB |
Output is correct |
20 |
Correct |
0 ms |
6552 KB |
Output is correct |
21 |
Correct |
0 ms |
6552 KB |
Output is correct |
22 |
Correct |
0 ms |
6552 KB |
Output is correct |
23 |
Correct |
0 ms |
6552 KB |
Output is correct |
24 |
Correct |
2 ms |
6552 KB |
Output is correct |
25 |
Correct |
0 ms |
6552 KB |
Output is correct |
26 |
Correct |
0 ms |
6552 KB |
Output is correct |
27 |
Correct |
2 ms |
6552 KB |
Output is correct |
28 |
Correct |
0 ms |
6552 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
6552 KB |
Output is correct |
2 |
Correct |
5 ms |
6552 KB |
Output is correct |
3 |
Correct |
13 ms |
6552 KB |
Output is correct |
4 |
Correct |
0 ms |
6552 KB |
Output is correct |
5 |
Correct |
11 ms |
6552 KB |
Output is correct |
6 |
Correct |
0 ms |
6552 KB |
Output is correct |
7 |
Correct |
0 ms |
6552 KB |
Output is correct |
8 |
Correct |
0 ms |
6552 KB |
Output is correct |
9 |
Correct |
0 ms |
6552 KB |
Output is correct |
10 |
Correct |
0 ms |
6552 KB |
Output is correct |
11 |
Correct |
18 ms |
6552 KB |
Output is correct |
12 |
Correct |
0 ms |
6552 KB |
Output is correct |
13 |
Correct |
7 ms |
6552 KB |
Output is correct |
14 |
Correct |
11 ms |
6552 KB |
Output is correct |
15 |
Correct |
17 ms |
6552 KB |
Output is correct |
16 |
Correct |
10 ms |
6552 KB |
Output is correct |
17 |
Correct |
26 ms |
6552 KB |
Output is correct |
18 |
Correct |
12 ms |
6552 KB |
Output is correct |
19 |
Correct |
13 ms |
6552 KB |
Output is correct |
20 |
Correct |
12 ms |
6552 KB |
Output is correct |