Submission #787530

#TimeUsernameProblemLanguageResultExecution timeMemory
787530BlagojRice Hub (IOI11_ricehub)C++17
0 / 100
2 ms468 KiB
#include <bits/stdc++.h> #include "ricehub.h" using namespace std; #define ll long long int besthub(int R, int L, int X[], ll B) { ll ans = 1, cntL = 1, sum = 0, l = 0; for (int i = 1; i < R; i++) { sum += cntL * (X[i] - X[i - 1]); while (sum > B) { sum -= X[i] - X[l]; l++; cntL--; } cntL++; ans = max(ans, cntL); } 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...