제출 #16222

#제출 시각아이디문제언어결과실행 시간메모리
16222ggoh쌀 창고 (IOI11_ricehub)C++98
0 / 100
4 ms4988 KiB
#include "ricehub.h" #include<cstdio> int besthub(int R,int L,int *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; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...