Submission #1249355

#TimeUsernameProblemLanguageResultExecution timeMemory
1249355_HDHRice Hub (IOI11_ricehub)C++20
0 / 100
0 ms320 KiB
#include "ricehub.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; int besthub(int R, int L, int X[], long long B) { vector<ll> psum(R); psum[0] = X[0]; for (int i = 1; i < R; i++){ psum[i] = psum[i - 1] + X[i]; } int ans = 0; for (int i = 0; i < R; i++){ for (int j = i; j < R; j++){ int mid = (i + j) / 2; ll sum_left = psum[mid] - (i - 1 > 0? psum[i - 1]: 0); ll sum_right = psum[j] - psum[mid]; ll sum = sum_right - (1LL * X[mid] * (j - mid)) + (1LL * X[mid] * (mid - i + 1)) - sum_left; if (sum <= B) 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...