# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
16218 | 2015-08-18T07:37:31 Z | ggoh | Rice Hub (IOI11_ricehub) | C++ | 0 ms | 0 KB |
#include<cstdio> long long besthub(long long R,long long L,long long X[],long long B) { long long ch,s,p,q,h,i; p=0;q=R+1; while(p!=q-1) { h=(p+q)/2; s=0; ch=0; for(i=h/2;i<h;i++) { s+=(X[i]-X[h-1-i]); } if(s<=B)ch=1; for(i=h;i<R&&ch==0;i++) { s+=(X[i]-X[i-h/2]); s-=(X[i-h/2]-X[i-h]); if(s<=B)ch=1; } if(ch)p=h; else q=h; } return p; }