Submission #552406

#TimeUsernameProblemLanguageResultExecution timeMemory
552406WasrekRice Hub (IOI11_ricehub)C++14
0 / 100
4 ms512 KiB
#include<bits/stdc++.h> // #include "grader.cpp" #include "ricehub.h" using namespace std; int qs[100010]; int besthub(int R, int L, int X[], long long B) { int now=0,temp,ans=1; for(int i=0, j=0;i<R && j<R;i++){ if(i!=1) now-=X[(i+j)>>1]-X[i-1]; if(j<i)j=i,now=0; while(j<(R-1)){//move j temp=(X[j+1]-X[(i+j+1)>>1]); if(now+temp<=B) j++,now+=temp; else break; } // printf("%d %d\n",i,j); ans=max(ans,j-i+1); if(j==R-1) break; } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...