# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
493995 | FerThugGato12500 | 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>
#include "ricehub.h"
using namespace std;
bool f(int k, int n, int &p[], long long B){
if(k==0) return true;
int med = k/2;
long long D = 0;
for(int i = 0; i < k; i++){
D+=abs(p[med]-p[i]);
}
long long d = D;
for(int l = 1; l+k<=n; l++){
D-=abs(p[med]-p[l-1]);
med++;
D+=abs(p[med]-p[(l+k)-1]);
d = min(d, D);
}
return d <= B;
}
int besthub(int n, int L, int p[], long long B)
{
int ini = 0, fin = n;
while(ini+1<fin){
int mit = (ini+fin)/2;
if(f(mit,n, p, B)){
ini = mit;
}else{
fin = mit-1;
}
}
if(f(fin,n, p,B)) return fin;
return ini;
}