#include "ricehub.h"
#include<bits/stdc++.h>
#define fori(a,b,c) for(a=b;a<c;a++)
#define ford(a,b,c) for(a=b;a>=c;a--)
#define pb push_back
#define pii pair<int,int>
#define mii map<int,int>
#define mp make_pair
#define pcc pair<char,char>
#define ll long long
#define pll pair<long long,long long>
#define fi first
#define se second
#define pss pair<short, short>
#define pq priority_queue
using namespace std;
ll sum[100004];
int besthub(int R, int L, int X[], long long B)
{
int l,r;
sum[0]=X[0];
int i,j,k;
fori(i,1,R){
sum[i]+=sum[i-1]+(long long)X[i];
}
int ans=0;
r=0;
fori(l,0,R){
while(r<R){
int mid=(l+r)/2;
ll b=0;
b+=(long long)X[mid]*(mid-l);
if(mid)
b-=sum[mid-1];
if(l)
b+=sum[l-1];
b+=(long long)sum[r]-sum[mid]-(long long)X[mid]*(r-mid);
if(b>B)
break;
r++;
}
ans=max(ans,r-l);
}
R=ans;
return R;
}
Compilation message
ricehub.cpp: In function 'int besthub(int, int, int*, long long int)':
ricehub.cpp:24:8: warning: unused variable 'j' [-Wunused-variable]
int i,j,k;
^
ricehub.cpp:24:10: warning: unused variable 'k' [-Wunused-variable]
int i,j,k;
^
# |
결과 |
실행 시간 |
메모리 |
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 |
13 ms |
6708 KB |
Output is correct |
4 |
Correct |
13 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 |
13 ms |
6708 KB |
Output is correct |
8 |
Correct |
13 ms |
6708 KB |
Output is correct |
9 |
Correct |
3 ms |
6708 KB |
Output is correct |
10 |
Correct |
6 ms |
6708 KB |
Output is correct |
11 |
Correct |
13 ms |
6708 KB |
Output is correct |
12 |
Correct |
19 ms |
6708 KB |
Output is correct |
13 |
Correct |
6 ms |
6708 KB |
Output is correct |
14 |
Correct |
3 ms |
6708 KB |
Output is correct |
15 |
Correct |
13 ms |
6708 KB |
Output is correct |
16 |
Correct |
9 ms |
6708 KB |
Output is correct |
17 |
Correct |
16 ms |
6708 KB |
Output is correct |
18 |
Correct |
16 ms |
6708 KB |
Output is correct |
19 |
Correct |
16 ms |
6708 KB |
Output is correct |
20 |
Correct |
19 ms |
6708 KB |
Output is correct |