Submission #976531

#TimeUsernameProblemLanguageResultExecution timeMemory
976531blackslexRice Hub (IOI11_ricehub)C++17
68 / 100
1071 ms4700 KiB
#include "ricehub.h" #include<bits/stdc++.h> using namespace std; using ll = long long; int besthub (int R, int L, int X[], long long B) { vector<int> x(R + 5); vector<ll> pref(R + 5); for (int i = 1; i <= R; i++) x[i] = X[i - 1], pref[i] = pref[i - 1] + x[i]; for (int sz = R; sz >= 1; sz--) { for (int l = 1, r = l + sz - 1; r <= R; l++, r++) { int mid = (l + r) >> 1; ll curl = x[mid] * (mid - l) - (pref[mid - 1] - pref[l - 1]); ll curr = (pref[r] - pref[mid]) - x[mid] * (r - mid); if (curl + curr <= B) return (int) sz; } } return 0; // return R; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...