#include "ricehub.h"
#include<algorithm>
using namespace std;
int besthub(int r, int l, int x[], long long b){
int duz=0;
long long cena=0;
int res=0;
for(int i=0;i<r;i++){
while(i-duz-1>=0 && i+duz+1<r){
if(cena+abs(x[i]-x[i-duz-1])+abs(x[i]-x[i+duz+1])>b) break;
cena+=abs(x[i]-x[i-duz-1])+abs(x[i]-x[i+duz+1]);
duz++;
}
res=max(res,2*duz+1);
if(i-duz-1>=0){
if(cena+abs(x[i]-x[i-duz-1])<=b) res=max(res,2*duz+2);
}
if(i+duz+1<r){
if(cena+abs(x[i]-x[i+duz+1])<=b) res=max(res,2*duz+2);
}
if(i<r-1 && duz>0){
cena+=x[i+1]-x[i];
cena-=abs(x[i+1]-x[i-duz]);
cena-=abs(x[i+1]-x[i-duz+1]);
duz--;
}
}
return res;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
296 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
300 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
292 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
0 ms |
212 KB |
Output is correct |
12 |
Correct |
0 ms |
212 KB |
Output is correct |
13 |
Correct |
0 ms |
212 KB |
Output is correct |
14 |
Correct |
0 ms |
212 KB |
Output is correct |
15 |
Correct |
0 ms |
296 KB |
Output is correct |
16 |
Correct |
0 ms |
212 KB |
Output is correct |
17 |
Correct |
0 ms |
212 KB |
Output is correct |
18 |
Correct |
0 ms |
212 KB |
Output is correct |
19 |
Correct |
0 ms |
212 KB |
Output is correct |
20 |
Correct |
0 ms |
212 KB |
Output is correct |
21 |
Correct |
0 ms |
212 KB |
Output is correct |
22 |
Correct |
1 ms |
296 KB |
Output is correct |
23 |
Correct |
0 ms |
212 KB |
Output is correct |
24 |
Correct |
0 ms |
212 KB |
Output is correct |
25 |
Correct |
1 ms |
212 KB |
Output is correct |
26 |
Correct |
0 ms |
292 KB |
Output is correct |
27 |
Correct |
1 ms |
212 KB |
Output is correct |
28 |
Correct |
0 ms |
300 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
296 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
0 ms |
212 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
0 ms |
212 KB |
Output is correct |
13 |
Correct |
0 ms |
212 KB |
Output is correct |
14 |
Correct |
0 ms |
212 KB |
Output is correct |
15 |
Correct |
0 ms |
212 KB |
Output is correct |
16 |
Correct |
1 ms |
292 KB |
Output is correct |
17 |
Correct |
1 ms |
212 KB |
Output is correct |
18 |
Correct |
0 ms |
300 KB |
Output is correct |
19 |
Correct |
1 ms |
296 KB |
Output is correct |
20 |
Correct |
1 ms |
296 KB |
Output is correct |
21 |
Correct |
1 ms |
308 KB |
Output is correct |
22 |
Correct |
1 ms |
308 KB |
Output is correct |
23 |
Correct |
1 ms |
340 KB |
Output is correct |
24 |
Correct |
1 ms |
308 KB |
Output is correct |
25 |
Correct |
1 ms |
340 KB |
Output is correct |
26 |
Correct |
1 ms |
340 KB |
Output is correct |
27 |
Correct |
1 ms |
336 KB |
Output is correct |
28 |
Correct |
1 ms |
332 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
340 KB |
Output is correct |
2 |
Correct |
2 ms |
440 KB |
Output is correct |
3 |
Correct |
13 ms |
1648 KB |
Output is correct |
4 |
Correct |
13 ms |
1620 KB |
Output is correct |
5 |
Correct |
6 ms |
820 KB |
Output is correct |
6 |
Correct |
6 ms |
816 KB |
Output is correct |
7 |
Correct |
12 ms |
1356 KB |
Output is correct |
8 |
Correct |
12 ms |
1360 KB |
Output is correct |
9 |
Correct |
6 ms |
724 KB |
Output is correct |
10 |
Correct |
5 ms |
696 KB |
Output is correct |
11 |
Correct |
15 ms |
1672 KB |
Output is correct |
12 |
Correct |
14 ms |
1716 KB |
Output is correct |
13 |
Correct |
6 ms |
788 KB |
Output is correct |
14 |
Correct |
6 ms |
820 KB |
Output is correct |
15 |
Correct |
10 ms |
1332 KB |
Output is correct |
16 |
Correct |
16 ms |
1244 KB |
Output is correct |
17 |
Correct |
12 ms |
1468 KB |
Output is correct |
18 |
Correct |
12 ms |
1492 KB |
Output is correct |
19 |
Correct |
13 ms |
1608 KB |
Output is correct |
20 |
Correct |
13 ms |
1564 KB |
Output is correct |