#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXR = 111111;
typedef long long lld;
lld psum[MAXR];
lld interval( int i, int j ) {
// [i, j]
int m = (i + j)/2, x = psum[m] - psum[m-1];
return ( 2*m - i - j ) * 1LL * x - psum[m-1] + psum[i-1] + psum[j] - psum[m];
}
int besthub(int R, int L, int X[], long long B)
{
for(int i=1; i<=R; i++) psum[i] = psum[i-1] + X[i-1];
int j = 1, ret = 0;
for(int i=1; i<=R; i++)
while( j<=R && interval(i, j) <= B ) ret = max( ret, j-i+1), j++;
return ret;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
6496 KB |
Output is correct |
2 |
Correct |
0 ms |
6496 KB |
Output is correct |
3 |
Correct |
0 ms |
6496 KB |
Output is correct |
4 |
Correct |
0 ms |
6496 KB |
Output is correct |
5 |
Correct |
0 ms |
6496 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
6496 KB |
Output is correct |
2 |
Correct |
0 ms |
6496 KB |
Output is correct |
3 |
Correct |
0 ms |
6496 KB |
Output is correct |
4 |
Correct |
0 ms |
6496 KB |
Output is correct |
5 |
Correct |
0 ms |
6496 KB |
Output is correct |
6 |
Correct |
0 ms |
6496 KB |
Output is correct |
7 |
Correct |
0 ms |
6496 KB |
Output is correct |
8 |
Correct |
0 ms |
6496 KB |
Output is correct |
9 |
Correct |
0 ms |
6496 KB |
Output is correct |
10 |
Correct |
0 ms |
6496 KB |
Output is correct |
11 |
Correct |
0 ms |
6496 KB |
Output is correct |
12 |
Correct |
0 ms |
6496 KB |
Output is correct |
13 |
Correct |
0 ms |
6496 KB |
Output is correct |
14 |
Correct |
0 ms |
6496 KB |
Output is correct |
15 |
Correct |
0 ms |
6496 KB |
Output is correct |
16 |
Correct |
0 ms |
6496 KB |
Output is correct |
17 |
Correct |
0 ms |
6496 KB |
Output is correct |
18 |
Correct |
0 ms |
6496 KB |
Output is correct |
19 |
Correct |
0 ms |
6496 KB |
Output is correct |
20 |
Correct |
0 ms |
6496 KB |
Output is correct |
21 |
Correct |
0 ms |
6496 KB |
Output is correct |
22 |
Correct |
0 ms |
6496 KB |
Output is correct |
23 |
Correct |
0 ms |
6496 KB |
Output is correct |
24 |
Correct |
0 ms |
6496 KB |
Output is correct |
25 |
Correct |
0 ms |
6496 KB |
Output is correct |
26 |
Correct |
0 ms |
6496 KB |
Output is correct |
27 |
Correct |
0 ms |
6496 KB |
Output is correct |
28 |
Correct |
0 ms |
6496 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
6496 KB |
Output is correct |
2 |
Correct |
0 ms |
6496 KB |
Output is correct |
3 |
Correct |
0 ms |
6496 KB |
Output is correct |
4 |
Correct |
0 ms |
6496 KB |
Output is correct |
5 |
Correct |
0 ms |
6496 KB |
Output is correct |
6 |
Correct |
0 ms |
6496 KB |
Output is correct |
7 |
Correct |
0 ms |
6496 KB |
Output is correct |
8 |
Correct |
0 ms |
6496 KB |
Output is correct |
9 |
Correct |
0 ms |
6496 KB |
Output is correct |
10 |
Correct |
1 ms |
6496 KB |
Output is correct |
11 |
Correct |
0 ms |
6496 KB |
Output is correct |
12 |
Correct |
0 ms |
6496 KB |
Output is correct |
13 |
Correct |
0 ms |
6496 KB |
Output is correct |
14 |
Correct |
0 ms |
6496 KB |
Output is correct |
15 |
Correct |
0 ms |
6496 KB |
Output is correct |
16 |
Correct |
0 ms |
6496 KB |
Output is correct |
17 |
Correct |
0 ms |
6496 KB |
Output is correct |
18 |
Correct |
0 ms |
6496 KB |
Output is correct |
19 |
Correct |
0 ms |
6496 KB |
Output is correct |
20 |
Correct |
0 ms |
6496 KB |
Output is correct |
21 |
Correct |
0 ms |
6496 KB |
Output is correct |
22 |
Correct |
0 ms |
6496 KB |
Output is correct |
23 |
Correct |
0 ms |
6496 KB |
Output is correct |
24 |
Correct |
0 ms |
6496 KB |
Output is correct |
25 |
Correct |
0 ms |
6496 KB |
Output is correct |
26 |
Correct |
0 ms |
6496 KB |
Output is correct |
27 |
Correct |
0 ms |
6496 KB |
Output is correct |
28 |
Correct |
0 ms |
6496 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
6496 KB |
Output is correct |
2 |
Correct |
0 ms |
6496 KB |
Output is correct |
3 |
Correct |
0 ms |
6496 KB |
Output is correct |
4 |
Correct |
17 ms |
6496 KB |
Output is correct |
5 |
Correct |
0 ms |
6496 KB |
Output is correct |
6 |
Correct |
6 ms |
6496 KB |
Output is correct |
7 |
Correct |
0 ms |
6496 KB |
Output is correct |
8 |
Correct |
11 ms |
6496 KB |
Output is correct |
9 |
Correct |
0 ms |
6496 KB |
Output is correct |
10 |
Correct |
6 ms |
6496 KB |
Output is correct |
11 |
Correct |
27 ms |
6496 KB |
Output is correct |
12 |
Correct |
17 ms |
6496 KB |
Output is correct |
13 |
Correct |
6 ms |
6496 KB |
Output is correct |
14 |
Correct |
7 ms |
6496 KB |
Output is correct |
15 |
Correct |
13 ms |
6496 KB |
Output is correct |
16 |
Correct |
0 ms |
6496 KB |
Output is correct |
17 |
Correct |
22 ms |
6496 KB |
Output is correct |
18 |
Correct |
13 ms |
6496 KB |
Output is correct |
19 |
Correct |
0 ms |
6496 KB |
Output is correct |
20 |
Correct |
16 ms |
6496 KB |
Output is correct |