Submission #534873

#TimeUsernameProblemLanguageResultExecution timeMemory
534873GurbanRice Hub (IOI11_ricehub)C++17
42 / 100
1086 ms396 KiB
#include <bits/stdc++.h> #include "ricehub.h" using namespace std; using ll = long long; int besthub(int R, int L, int X[], long long B){ // p[0] = X[0]; // for(int i = 1;i < R;i++) p[i] = p[i - 1] + X[i]; int ans = 1; for(int i = 0;i < R;i++){ for(int j = 0;j < i;j++){ int md = (i + j) >> 1; ll now = 0; for(int k = j;k <= md;k++) now += X[md] - X[k]; for(int k = md+1;k <= i;k++) now += X[k] - X[md]; if(now <= B) ans = max(ans,i - j + 1); } } return ans; } // int main(){ // ios::sync_with_stdio(false); // cin.tie(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...