This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define designed ios_base::sync_with_stdio(0);
#define by cin.tie(0);
#define AndreasK cout.tie(0);
//#define int long long
#define ii pair <int,int>
#define vi vector <int>
#define iii pair <int,ii>
#define vii vector <ii>
#define vc vector <char>
#define vb vector <bool>
int besthub(int R, int L, int X[], long long B)
{
#define int long long
int pre[R];
int ttl=0;
for (int c=0;c<R;c++){
ttl+=X[c];
pre[c]=ttl;
}
int mx=0;
for (int r=0;r<R;r++){
int ll=r,rr=(R-1+r)/2,mid;
while (ll<=rr){
mid=(ll+rr)/2;
int f=0;
if (r==0){
f+=(mid-r+1)*X[mid]-pre[mid];
}
else{
f+=(mid-r+1)*X[mid]-pre[mid]+pre[r-1];
}
int f1;
if (mid!=0){
f1=f+pre[mid+(mid-r)]-pre[mid-1]-(mid-r+1)*X[mid];
}
else{
f1=f+pre[mid+(mid-r)]-(mid-r+1)*X[mid];
}
int f2=INT_MAX;
if (mid+mid-r+1<R){
if (mid!=0){
f2=f+pre[mid+(mid-r+1)]-pre[mid-1]-(mid-r+2)*X[mid];
}
else{
f2=f+pre[mid+(mid-r+1)]-(mid-r+2)*X[mid];
}
}
if (f1<=B){
mx=max(mx,2*(mid-r)+1);
}
if (f2<=B){
mx=max(mx,2*(mid-r)+2);
}
if (f1<=B){
ll=mid+1;
}
else
rr=mid-1;
}
}
return mx;
}
/*int32_t main(){
designed by AndreasK
int R,L,B;
cin>>R>>L>>B;
int X[R];
for (auto &c:X)
cin>>c;
cout<<besthub(R,L,X,B);
return 0;}*/
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |