Submission #7320

#TimeUsernameProblemLanguageResultExecution timeMemory
7320kriiiRice Hub (IOI11_ricehub)C++98
100 / 100
20 ms4992 KiB
#include "ricehub.h" int besthub(int N, int L, int X[], long long B) { int A = 0; long long S = 0; for (int i=0,j=0;j<N;){ for (S+=X[j++]-X[(i+j)/2];S>B;S-=X[(i+j)/2]-X[i++]); if (A < j - i) A = j - i; } return A; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...