# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1027078 | kkkkkkkk | 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>
using namespace std;
#define int long long
vector<int> v;
int B;
bool proveri(int k) {
for (int i=0;i<v.size()-k;i++) {
int hub_poz=v[(i+i+k)/2];
int zbir=0;
bool ok=true;
for (int j=i;j<i+k;j++) {
zbir+=hub_poz-v[j];
if (zbir>B) {
ok=false;
break;
}
}
if (ok) return true;
}
return false;
}
int besthub(int R, int L, int a[], int b) {
B=b;
for (int i=0;i<R;i++)
v.push_back(a[i]);
int l=1, r=R+1;
while (l+1<r) {
int mid=(l+r)/2;
if (proveri(mid)) l=mid;
else r=mid;
}
return l;
}