Submission #481432

#TimeUsernameProblemLanguageResultExecution timeMemory
481432Mihai_EduardRice Hub (IOI11_ricehub)C++14
68 / 100
164 ms1740 KiB
bool verify(int r, int l, int x[], long long b, int nr) { int st, dr, mij, total; for(int i=0;i<r-nr+1;i++) { st=i; dr=i+nr-1; mij=(st+dr)/2; total=0; for(int j=st;j<=mij;j++) total+=x[mij]-x[j]; for(int j=mij+1;j<=dr;j++) total+=x[j]-x[mij]; if(total<=b) return true; } return false; } int besthub(int r, int l, int x[], long long b) { int st=1, dr=r+1, mij; while(dr-st>1) { mij=(st+dr)/2; if(verify(r,l,x,b,mij)) st=mij; else dr=mij; } return st; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...