# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
289391 | BeanZ | Rice Hub (IOI11_ricehub) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;
#define ll long long
#define endl '\n'
const int N = 1e5 + 5;
ll besthub(ll r, ll l, ll 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);
}
}
/*
*/