# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
660282 | 2022-11-21T13:08:18 Z | Trisanu_Das | Rice Hub (IOI11_ricehub) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; #include "ricehub.h" int besthub(int n, int l, int *x, int b){ int ans = 0; long long curr_cost = 0; for(int l = 0, r = 0; l < n; l++){ while(r + 1 < n && curr_cost + x[r + 1] - x[(l + r + 1) / 2] <= b){ curr_cost += x[r + 1] - x[(l + r + 1) / 2]; r++; ans = max(ans, r - l + 1); } curr_cost += x[l] + x[(l + r + 1) / 2]; } cout << ans << '\n'; }