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 "ricehub.h"
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=100005;
ll ans, pref[N], l, r, m, bb, x[N];
bool check(){
m=l+r>>1;
ll b=pref[r]+(l>0)*pref[l-1]-(m>0)*2*pref[m];
if((l+r)%2==0) b+=x[m];
return b<=bb;
}
int besthub(int R,int L,int X[],ll B){
bb=B;
for (int i=0; i<R; i++)x[i]=X[i],pref[i]=X[i]+(i>0)*pref[i-1];
for (r=0; r<R; r++){
while(l<r&&!check())l++;
ans=max(ans, r-l+1);
}
return ans;
}
Compilation message (stderr)
ricehub.cpp: In function 'bool check()':
ricehub.cpp:8:5: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
8 | m=l+r>>1;
| ~^~
# | 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... |