Submission #7319

#TimeUsernameProblemLanguageResultExecution timeMemory
7319kriiiRice Hub (IOI11_ricehub)C++98
100 / 100
20 ms4992 KiB
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;){ S += X[j] - X[(i+j)/2]; j++; while (i < j && S > B){ S -= X[(i+j)/2] - X[i]; 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...