Submission #563294

#TimeUsernameProblemLanguageResultExecution timeMemory
5632941neRice Hub (IOI11_ricehub)C++14
0 / 100
2 ms340 KiB
#include "ricehub.h" #include<bits/stdc++.h> using namespace std; int besthub(int R, int L, int X[], long long B) { int ans = 0; int l = 0,r = 0; long long cost = B; while(l<=r && r < R){ if (r + 1 < R && X[r + 1] - X[r] <= cost){ cost-=X[r + 1] - X[r]; ++r; } else if (l + 1<=r) { cost+=X[l + 1] - X[l]; ++l; } else { l++; r = l; cost = B; } ans = max(ans,r - l + 1); } 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...