#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;
#define int long long
const int INF = 1e18;
vector< int > pref;
int calc(int left, int right, int B, int X[]){
int l = left, r = right;
while(l < r){
int mid = (l+r+1)/2;
int k = (l+mid)/2;
int cost = X[k-1]*(k-left+1)-(pref[k]-pref[left-1])+(pref[mid]-pref[k])-(mid-k)*X[k-1];
if(cost > B){
r = mid-1;
}else{
l = mid;
}
}
return l-left+1;
}
int besthub(int R, int L, int X[], int B){
pref.resize(R+1);
for(int i = 0; i < R; i++){
pref[i+1] += pref[i];
pref[i+1] += X[i];
}
int ans = -INF;
for(int i = 1; i <= R; i++){
ans = max(calc(i,R,B,X), ans);
}
return ans;
}
/*
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int r, l, b;
cin >> r >> l >> b;
int x[r];
for(int i = 0; i < r; i++) cin >> x[i];
cout << besthub(r,l,x,b) << endl;
}
*/
Compilation message
/tmp/ccEiHEgX.o: In function `main':
grader.cpp:(.text.startup+0x92): undefined reference to `besthub(int, int, int*, long long)'
collect2: error: ld returned 1 exit status
