#include "ricehub.h"
#include<algorithm>
int besthub(int R, int L, int X[], long long B)
{
int optimalGain=0;
int m, l, r;
l = r = m = 0;
long long spent = 0;
int localGain = 1;
while(1) {
if(r!=(R-1))r++;
else break;
spent+= X[r]-X[m];
m = (r+l+1)/2;
if(spent>B) {
optimalGain = std::max(optimalGain, localGain);
while(spent>B) {
spent+= X[l]-X[m];
l++;
m = (r+l+1)/2;
localGain--;
}
}
localGain++;
}
optimalGain = std::max(optimalGain, localGain);
return optimalGain ;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
5020 KB |
Output is correct |
2 |
Correct |
0 ms |
5020 KB |
Output is correct |
3 |
Correct |
0 ms |
5020 KB |
Output is correct |
4 |
Correct |
0 ms |
5020 KB |
Output is correct |
5 |
Correct |
0 ms |
5020 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
5020 KB |
Output is correct |
2 |
Correct |
0 ms |
5020 KB |
Output is correct |
3 |
Correct |
0 ms |
5020 KB |
Output is correct |
4 |
Correct |
0 ms |
5020 KB |
Output is correct |
5 |
Correct |
0 ms |
5020 KB |
Output is correct |
6 |
Correct |
0 ms |
5020 KB |
Output is correct |
7 |
Correct |
0 ms |
5020 KB |
Output is correct |
8 |
Correct |
0 ms |
5020 KB |
Output is correct |
9 |
Correct |
0 ms |
5020 KB |
Output is correct |
10 |
Correct |
0 ms |
5020 KB |
Output is correct |
11 |
Correct |
0 ms |
5020 KB |
Output is correct |
12 |
Correct |
0 ms |
5020 KB |
Output is correct |
13 |
Correct |
0 ms |
5020 KB |
Output is correct |
14 |
Correct |
0 ms |
5020 KB |
Output is correct |
15 |
Correct |
0 ms |
5020 KB |
Output is correct |
16 |
Correct |
0 ms |
5020 KB |
Output is correct |
17 |
Correct |
0 ms |
5020 KB |
Output is correct |
18 |
Correct |
0 ms |
5020 KB |
Output is correct |
19 |
Correct |
0 ms |
5020 KB |
Output is correct |
20 |
Correct |
0 ms |
5020 KB |
Output is correct |
21 |
Correct |
0 ms |
5020 KB |
Output is correct |
22 |
Correct |
0 ms |
5020 KB |
Output is correct |
23 |
Correct |
0 ms |
5020 KB |
Output is correct |
24 |
Correct |
0 ms |
5020 KB |
Output is correct |
25 |
Correct |
0 ms |
5020 KB |
Output is correct |
26 |
Correct |
0 ms |
5020 KB |
Output is correct |
27 |
Correct |
0 ms |
5020 KB |
Output is correct |
28 |
Correct |
0 ms |
5020 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
5020 KB |
Output is correct |
2 |
Correct |
0 ms |
5020 KB |
Output is correct |
3 |
Correct |
0 ms |
5020 KB |
Output is correct |
4 |
Correct |
0 ms |
5020 KB |
Output is correct |
5 |
Correct |
0 ms |
5020 KB |
Output is correct |
6 |
Correct |
0 ms |
5020 KB |
Output is correct |
7 |
Correct |
0 ms |
5020 KB |
Output is correct |
8 |
Correct |
0 ms |
5020 KB |
Output is correct |
9 |
Correct |
0 ms |
5020 KB |
Output is correct |
10 |
Correct |
0 ms |
5020 KB |
Output is correct |
11 |
Correct |
0 ms |
5020 KB |
Output is correct |
12 |
Correct |
0 ms |
5020 KB |
Output is correct |
13 |
Correct |
0 ms |
5020 KB |
Output is correct |
14 |
Correct |
0 ms |
5020 KB |
Output is correct |
15 |
Correct |
0 ms |
5020 KB |
Output is correct |
16 |
Correct |
0 ms |
5020 KB |
Output is correct |
17 |
Correct |
0 ms |
5020 KB |
Output is correct |
18 |
Correct |
0 ms |
5020 KB |
Output is correct |
19 |
Correct |
0 ms |
5020 KB |
Output is correct |
20 |
Correct |
0 ms |
5020 KB |
Output is correct |
21 |
Correct |
0 ms |
5020 KB |
Output is correct |
22 |
Correct |
0 ms |
5020 KB |
Output is correct |
23 |
Correct |
0 ms |
5020 KB |
Output is correct |
24 |
Correct |
0 ms |
5020 KB |
Output is correct |
25 |
Correct |
0 ms |
5020 KB |
Output is correct |
26 |
Correct |
0 ms |
5020 KB |
Output is correct |
27 |
Correct |
0 ms |
5020 KB |
Output is correct |
28 |
Correct |
0 ms |
5020 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
5020 KB |
Output is correct |
2 |
Correct |
0 ms |
5020 KB |
Output is correct |
3 |
Correct |
23 ms |
5020 KB |
Output is correct |
4 |
Correct |
13 ms |
5020 KB |
Output is correct |
5 |
Correct |
6 ms |
5020 KB |
Output is correct |
6 |
Correct |
6 ms |
5020 KB |
Output is correct |
7 |
Correct |
16 ms |
5020 KB |
Output is correct |
8 |
Correct |
16 ms |
5020 KB |
Output is correct |
9 |
Correct |
6 ms |
5020 KB |
Output is correct |
10 |
Correct |
6 ms |
5020 KB |
Output is correct |
11 |
Correct |
16 ms |
5020 KB |
Output is correct |
12 |
Correct |
16 ms |
5020 KB |
Output is correct |
13 |
Correct |
3 ms |
5020 KB |
Output is correct |
14 |
Correct |
6 ms |
5020 KB |
Output is correct |
15 |
Correct |
9 ms |
5020 KB |
Output is correct |
16 |
Correct |
9 ms |
5020 KB |
Output is correct |
17 |
Correct |
16 ms |
5020 KB |
Output is correct |
18 |
Correct |
16 ms |
5020 KB |
Output is correct |
19 |
Correct |
16 ms |
5020 KB |
Output is correct |
20 |
Correct |
19 ms |
5020 KB |
Output is correct |