Submission #936154

#TimeUsernameProblemLanguageResultExecution timeMemory
936154AtabayRajabliRice Hub (IOI11_ricehub)C++17
0 / 100
3 ms2652 KiB
#include "ricehub.h" #include <bits/stdc++.h> using namespace std; long long p[100005]; long long cost(int l, int r) { int m = (l + r) >> 1; int med = p[m] - p[m - 1]; return med * (m - l + 1) - (p[m] - p[l - 1]) + p[r] - p[m] - med * (r - m); } int besthub(int R, int L, int X[], long long B) { for(int i = 0; i < R; i++) { p[i] = X[i] + (i > 0 ? p[i - 1] : 0LL); } int r = 0; long long ans = 0; for(int l = 0; l < R; l++) { while(r < R && cost(l, r) <= B) { ans = max(ans, cost(l, r)); r++; } } 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...