Submission #352040

#TimeUsernameProblemLanguageResultExecution timeMemory
352040NachoLibreRice Hub (IOI11_ricehub)C++17
100 / 100
17 ms1772 KiB
#include <bits/stdc++.h> using namespace std; #ifndef wambule #include "ricehub.h" #endif int besthub(int n, int, int x[], long long b) { int fp = 1; long long md = 0; for(int l = 0, m = 0, r = 1; r < n; ++r) { md += x[r] - x[m]; if(r - m > m - l + 1) (md += 1ll * (x[m + 1] - x[m]) * ((m - l + 1) - (r - m))), ++m; while(md > b) { md -= x[m] - x[l]; ++l; if(r - m > m - l + 1) (md += 1ll * (x[m + 1] - x[m]) * ((m - l + 1) - (r - m))), ++m; } fp = max(fp, r - l + 1); } return fp; } #ifdef wambule int main() { ios::sync_with_stdio(0); cin.tie(0); int a[] = {1, 2, 10, 12, 14}; cout << besthub(5, 0, a, 6) << endl; return 0; } #endif
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...