#include <bits/stdc++.h>
#include <ricehub.h>
using namespace std;
using ll = long long;
//#define int long long
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//void setupIO(){
// #define name "Whisper"
// //Phu Trong from Nguyen Tat Thanh High School for gifted student
// srand(time(NULL));
// cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
// freopen(name".inp", "r", stdin);
// freopen(name".out", "w", stdout);
// cout << fixed << setprecision(10);
//}
template <class X, class Y>
bool minimize(X &x, const Y &y){
X eps = 1e-9;
if (x > y + eps) {x = y; return 1;}
return 0;
}
template <class X, class Y>
bool maximize(X &x, const Y &y){
X eps = 1e-9;
if (x + eps < y) {x = y; return 1;}
return 0;
}
const int MAX = 1e5 + 5;
ll nArr, Lim, A[MAX], numCoin;
ll l[MAX], r[MAX], rsum[MAX], lsum[MAX];
ll Query(int L, int R){
if (L < R){
return (l[L + 1] - l[R]) - (lsum[L + 1] - lsum[R]) * (nArr - R) + A[R];
}
if (L > R){
return (r[R - 1] - r[L]) - (rsum[R - 1] - rsum[L]) * (L - 1) + A[L];
}
return 0;
}
ll besthub(int RR, int LL, int X[], ll B){
nArr = RR, Lim = LL, numCoin = B;
FOR(i, 1, nArr) A[i] = X[i - 1];
for (int i = 2; i <= nArr; ++i) A[i] = X[i - 1] - X[i - 2];
for (int i = 1; i <= nArr; ++i){
r[i] = r[i - 1] + A[i] * i;
rsum[i] = rsum[i - 1] + A[i];
}
for (int i = nArr; i >= 1; --i){
l[i] = l[i + 1] + A[i] * (nArr - i + 1);
lsum[i] = lsum[i + 1] + A[i];
}
int L = 1, R = 1;
for (int i = 1; i <= nArr; ++i){
if (Query(1, i) <= numCoin) {
R = i; break;
}
}
int ans = (R - L + 1);
for (int i = 2; i <= nArr; ++i){
ll sum = Query(L, i) + Query(i, R);
while (sum <= numCoin && R < nArr){
++R; sum = Query(L, i) + Query(i, R);
}
while (A[i] - A[L] >= A[R] - A[i] && L < i && R < nArr){
++L, ++R;
}
while (sum > numCoin && L < i){
++L;
sum = Query(L, i) + Query(i, R);
}
maximize(ans, R - L + 1);
}
return ans;
}
//int X[5] = {1, 2, 10, 12, 14};
//void Whisper(){
// int R = 5, L = 20, B = 6;
// cout << besthub(R, L, X, B);
//}
//
//
//signed main(){
// setupIO();
// int Test = 1;
//// cin >> Test;
// for ( int i = 1 ; i <= Test ; i++ ){
// Whisper();
// if (i < Test) cout << '\n';
// }
//}
Compilation message
ricehub.cpp:60:4: error: ambiguating new declaration of 'll besthub(int, int, int*, ll)'
60 | ll besthub(int RR, int LL, int X[], ll B){
| ^~~~~~~
In file included from ricehub.cpp:2:
ricehub.h:1:5: note: old declaration 'int besthub(int, int, int*, long long int)'
1 | int besthub(int R, int L, int X[], long long B);
| ^~~~~~~
