typedef long long ll;
int max(int x,int y){return x>y?x:y;}
int besthub(int N, int Eyfa, int X[], long long B){
X[N]=X[N-1];
int l=0,r=0,mid=0,ret=0;
ll sum=0;
bool ok=0;
while(r<N){
while(r<N&&sum<=B){
if(ok)mid++;
r++;
sum+=X[r]-X[mid];
ok=!ok;
ret=max(ret,r-l);
}
while(sum>B){
if(ok)mid++;
sum-=X[mid]-X[l];
l++;
ok=!ok;
}
}
return ret;
}
# |
결과 |
실행 시간 |
메모리 |
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 |
2 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 |
24 ms |
4988 KB |
Output is correct |
4 |
Correct |
13 ms |
4988 KB |
Output is correct |
5 |
Correct |
10 ms |
4988 KB |
Output is correct |
6 |
Correct |
9 ms |
4988 KB |
Output is correct |
7 |
Correct |
0 ms |
4988 KB |
Output is correct |
8 |
Correct |
22 ms |
4988 KB |
Output is correct |
9 |
Correct |
9 ms |
4988 KB |
Output is correct |
10 |
Correct |
9 ms |
4988 KB |
Output is correct |
11 |
Correct |
19 ms |
4988 KB |
Output is correct |
12 |
Correct |
28 ms |
4988 KB |
Output is correct |
13 |
Correct |
12 ms |
4988 KB |
Output is correct |
14 |
Correct |
3 ms |
4988 KB |
Output is correct |
15 |
Correct |
6 ms |
4988 KB |
Output is correct |
16 |
Correct |
18 ms |
4988 KB |
Output is correct |
17 |
Correct |
11 ms |
4988 KB |
Output is correct |
18 |
Correct |
16 ms |
4988 KB |
Output is correct |
19 |
Correct |
23 ms |
4988 KB |
Output is correct |
20 |
Correct |
12 ms |
4988 KB |
Output is correct |