# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
355591 | David_M | Rice Hub (IOI11_ricehub) | C++14 | 0 ms | 0 KiB |
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;
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+=(ll)X[m];
return b<=B;
}
int besthub(int R,int L,int X[],ll B){
for (int i=0; i<R; 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;
}