| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 660285 | Trisanu_Das | Rice Hub (IOI11_ricehub) | C++17 | 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>
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];
}
return ans;
}