# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
101104 | 2019-03-16T16:19:54 Z | ansol4328 | Rice Hub (IOI11_ricehub) | C++11 | 0 ms | 0 KB |
#include<stdio.h> typedef long long ll; bool pos(int del, long long *m, long long B, int n) { int cnt=n-del; int hcnt=cnt/2; long long d=0; for(int i=0 ; i<cnt/2 ; i++) d+=m[cnt-i+1]-m[i]; if(d<=B) return true; for(int i=0 ; i<n-cnt ; i++) { int didx=i, aidx=i+cnt; d-=m[didx+hcnt]-m[didx]; d+=m[aidx]-m[aidx-hcnt]; if(d<=B) return true; } return false; } int besthub(int R, long long L, long long *X, long long B) { int st=0, fn=R, mid, res; while(st<=fn) { mid=(st+fn)>>1; if(pos(mid,X,B,R)) fn=mid-1, res=mid; else st=mid+1; } return R-res; }