# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
289392 | 2020-09-02T15:51:14 Z | BeanZ | Rice Hub (IOI11_ricehub) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> #include "ricehub.h" using namespace std; #define ll long long #define endl '\n' const int N = 1e5 + 5; ll besthub(int r, int l, int x[], ll b){ ll lf = 1, rt = 1; ll cur = 0, ans = 0; while (rt < r && (cur + (x[rt] - x[0])) <= b) rt++; ans = max(ans, rt - lf + 1); for (int i = 2; i <= r; i++){ cur = cur - (rt - i + 1) * (x[i - 1] - x[i - 2]); cur = cur + (i - lf) * (x[i - 1] - x[i - 2]); while (cur > b){ cur = cur - (x[i - 1] - x[l - 1]); lf++; } while (rt < r && (cur + x[rt] - x[i - 1]) <= b){ cur = cur + x[rt] - x[i - 1]; rt++; } ans = max(ans, rt - lf + 1); } return ans; } /* int main(){ ios_base::sync_with_stdio(false); cin.tie(0); if (fopen("time.in", "r")){ freopen("time.in", "r", stdin); freopen("time.out", "w", stdout); } } /* */