# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
996362 | hasan2006 | 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;
#define ll long long
const int N = 1e5 + 9 , mod = 1e9 + 7;
ll a[N] ;
int besthub(int R, int L, vector<int>X, ll B) {
ll i , l , r , m , x , s , ans = 0;
for(i = 1; i <= R; i++)
a[i] = X[i - 1] + a[i - 1];
for(i = 1; i <= R; i++){
l = i , r = R;
while(l != r){
m = (l + r + 1) / 2;
x = (m + i) / 2;
s = (a[x] * (x - i) - (a[x - 1] - a[i - 1])) + (a[m] - a[x] - a[x] * (m - x));
if(s <= B) l = m;
else r = m - 1;
}
ans = max(ans , r - i + 1);
}
return ans;
}
// Author : حسن