#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;
#define pb push_back
#define fi first
#define se second
#define ll long long
const int MAX=1e5+10;
int n, l, b, pref[MAX], t[MAX];
bool spr(int x){
for(int i=1; i<=n-x+1; i++){
int mid=(i+i+x-1)/2;
int lewo=pref[mid-1]-pref[i-1];
int prawo=pref[i+x-1]-pref[mid];
if((mid-i)*t[mid]-lewo+prawo-(i+x-1-mid)*t[mid]<=b)
return true;
}
return false;
}
int besthub(int R, int L, int X[], int B){
n=R, l=L, b=B;
for(int i=1; i<=n; i++){
pref[i]=X[i-1];
t[i]=pref[i];
pref[i]+=pref[i-1];
}
int pocz=1, kon=n, sr, wynik=1;
while(pocz<=kon){
sr=(pocz+kon)/2;
if(spr(sr))
pocz=sr+1, wynik=sr;
else
kon=sr-1;
}
return wynik;
}
/*int main(){
ios_base::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
}*/
Compilation message
/usr/bin/ld: /tmp/ccJDKPN6.o: in function `main':
grader.cpp:(.text.startup+0xae): undefined reference to `besthub(int, int, int*, long long)'
collect2: error: ld returned 1 exit status
