Submission #735073

#TimeUsernameProblemLanguageResultExecution timeMemory
735073tigarRice Hub (IOI11_ricehub)C++14
0 / 100
12 ms2512 KiB
#include <bits/stdc++.h> #include "ricehub.h" using namespace std; typedef long long ll; ll prefs[100010]; ll cost(int l, int r, int *x) { int m=(l+r)/2; return prefs[r]-prefs[m]-(r-m)*x[m]+prefs[m]-prefs[l]-(m-l)*x[l]; } int besthub(int R, int L, int *X, ll B) { prefs[0]=X[0]; for(int i=1; i<R; i++)prefs[i]=prefs[i-1]+X[i]; int k=0, ans=0; for(int i=0; i<R; i++) { while(cost(k, i, X)>B)k++; ans=max(i-k+1, ans); } return ans; } /*int main() { int r, l, x[100010]; ll b; cin>>r>>l; for(int i=0; i<r; i++)cin>>x[i]; cin>>b; cout<<besthub(r, l, x, b); return 0; }*/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...