# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
355597 | 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>
using namespace std;
int besthub(int R,int L,int X[],ll B){
long long ans, pref[100005], l, r, m, b;
for (int i=0; i<R; i++)pref[i]=X[i]+(!!i)*pref[i-1];
for (r=0; r<R; r++){
while(l<r){
m=l+r>>1;
b=pref[r]+(!!l)*pref[l-1]-(pref[m]<<1);
if((l+r+1)&1)b+=X[m];
if(b<=B)break;
l++;
}
if(r-l>ans)ans=r-l;
}
return ans+1;
}