Submission #518807

#TimeUsernameProblemLanguageResultExecution timeMemory
518807sliviuRice Hub (IOI11_ricehub)C++17
100 / 100
12 ms2376 KiB
#include <bits/stdc++.h> #include "ricehub.h" using namespace std; int besthub(int n, int L, int a[], long long cmax) { vector<long long> s(n + 1); for (int i = 1; i <= n; ++i) s[i] = s[i - 1] + a[i - 1]; int ans = 0; for (int i = 1, j = 1; i <= n; ++i) { auto cost = [&](int l, int r) { int m = (l + r) / 2; return 1LL * (m - l) * a[m - 1] - (s[m - 1] - s[i - 1]) + s[r] - s[m] - 1LL * (r - m) * a[m - 1]; }; while (j + 1 <= n && cost(i, j + 1) <= cmax) ++j; ans = max(ans, j - i + 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...