#include "ricehub.h"
#include <bits/stdc++.h>
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define st first
#define nd second
#define forr(i,A,B) for(int i=A;i<B;++i)
#define space ' '
#define endl '\n'
#define LL long long
using namespace std;
int ans;
long long sum[100005];
int besthub(int R, int L, int X[], long long B){
int lp=0,rp=0;
forr(i,0,R){
sum[i]=sum[i-1]+X[i];
}
while(rp<R){
int mid=(lp+rp)/2;
long long cost=X[mid]*(mid-lp)-X[mid]*(rp-mid)-(sum[mid-1]-sum[lp-1])+(sum[rp]-sum[mid]);
if(cost>B){
lp++;
}
else{
ans=max(ans,rp-lp+1);
rp++;
}
}
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
6708 KB |
Output is correct |
2 |
Correct |
0 ms |
6708 KB |
Output is correct |
3 |
Correct |
0 ms |
6708 KB |
Output is correct |
4 |
Correct |
0 ms |
6708 KB |
Output is correct |
5 |
Correct |
0 ms |
6708 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
6708 KB |
Output is correct |
2 |
Correct |
0 ms |
6708 KB |
Output is correct |
3 |
Correct |
0 ms |
6708 KB |
Output is correct |
4 |
Correct |
0 ms |
6708 KB |
Output is correct |
5 |
Correct |
0 ms |
6708 KB |
Output is correct |
6 |
Correct |
0 ms |
6708 KB |
Output is correct |
7 |
Correct |
0 ms |
6708 KB |
Output is correct |
8 |
Correct |
0 ms |
6708 KB |
Output is correct |
9 |
Correct |
0 ms |
6708 KB |
Output is correct |
10 |
Correct |
0 ms |
6708 KB |
Output is correct |
11 |
Correct |
0 ms |
6708 KB |
Output is correct |
12 |
Correct |
0 ms |
6708 KB |
Output is correct |
13 |
Correct |
0 ms |
6708 KB |
Output is correct |
14 |
Correct |
0 ms |
6708 KB |
Output is correct |
15 |
Correct |
0 ms |
6708 KB |
Output is correct |
16 |
Correct |
0 ms |
6708 KB |
Output is correct |
17 |
Correct |
0 ms |
6708 KB |
Output is correct |
18 |
Correct |
0 ms |
6708 KB |
Output is correct |
19 |
Correct |
0 ms |
6708 KB |
Output is correct |
20 |
Correct |
0 ms |
6708 KB |
Output is correct |
21 |
Correct |
0 ms |
6708 KB |
Output is correct |
22 |
Correct |
0 ms |
6708 KB |
Output is correct |
23 |
Correct |
0 ms |
6708 KB |
Output is correct |
24 |
Correct |
0 ms |
6708 KB |
Output is correct |
25 |
Correct |
0 ms |
6708 KB |
Output is correct |
26 |
Correct |
0 ms |
6708 KB |
Output is correct |
27 |
Correct |
0 ms |
6708 KB |
Output is correct |
28 |
Correct |
0 ms |
6708 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
6708 KB |
Output is correct |
2 |
Correct |
0 ms |
6708 KB |
Output is correct |
3 |
Correct |
0 ms |
6708 KB |
Output is correct |
4 |
Correct |
0 ms |
6708 KB |
Output is correct |
5 |
Correct |
0 ms |
6708 KB |
Output is correct |
6 |
Correct |
0 ms |
6708 KB |
Output is correct |
7 |
Correct |
0 ms |
6708 KB |
Output is correct |
8 |
Correct |
0 ms |
6708 KB |
Output is correct |
9 |
Correct |
0 ms |
6708 KB |
Output is correct |
10 |
Correct |
0 ms |
6708 KB |
Output is correct |
11 |
Correct |
0 ms |
6708 KB |
Output is correct |
12 |
Correct |
0 ms |
6708 KB |
Output is correct |
13 |
Correct |
0 ms |
6708 KB |
Output is correct |
14 |
Correct |
0 ms |
6708 KB |
Output is correct |
15 |
Correct |
0 ms |
6708 KB |
Output is correct |
16 |
Correct |
0 ms |
6708 KB |
Output is correct |
17 |
Correct |
0 ms |
6708 KB |
Output is correct |
18 |
Correct |
0 ms |
6708 KB |
Output is correct |
19 |
Correct |
0 ms |
6708 KB |
Output is correct |
20 |
Correct |
0 ms |
6708 KB |
Output is correct |
21 |
Correct |
0 ms |
6708 KB |
Output is correct |
22 |
Correct |
0 ms |
6708 KB |
Output is correct |
23 |
Correct |
0 ms |
6708 KB |
Output is correct |
24 |
Correct |
0 ms |
6708 KB |
Output is correct |
25 |
Correct |
0 ms |
6708 KB |
Output is correct |
26 |
Correct |
0 ms |
6708 KB |
Output is correct |
27 |
Correct |
0 ms |
6708 KB |
Output is correct |
28 |
Correct |
0 ms |
6708 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
6708 KB |
Output is correct |
2 |
Correct |
3 ms |
6708 KB |
Output is correct |
3 |
Correct |
19 ms |
6708 KB |
Output is correct |
4 |
Correct |
16 ms |
6708 KB |
Output is correct |
5 |
Correct |
6 ms |
6708 KB |
Output is correct |
6 |
Correct |
6 ms |
6708 KB |
Output is correct |
7 |
Correct |
9 ms |
6708 KB |
Output is correct |
8 |
Correct |
9 ms |
6708 KB |
Output is correct |
9 |
Correct |
6 ms |
6708 KB |
Output is correct |
10 |
Correct |
6 ms |
6708 KB |
Output is correct |
11 |
Correct |
16 ms |
6708 KB |
Output is correct |
12 |
Correct |
23 ms |
6708 KB |
Output is correct |
13 |
Correct |
9 ms |
6708 KB |
Output is correct |
14 |
Correct |
6 ms |
6708 KB |
Output is correct |
15 |
Correct |
13 ms |
6708 KB |
Output is correct |
16 |
Correct |
16 ms |
6708 KB |
Output is correct |
17 |
Correct |
16 ms |
6708 KB |
Output is correct |
18 |
Correct |
13 ms |
6708 KB |
Output is correct |
19 |
Correct |
19 ms |
6708 KB |
Output is correct |
20 |
Correct |
23 ms |
6708 KB |
Output is correct |