#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
using str = string; // yay python!
using ii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vii = vector<ii>;
using vpl = vector<pl>;
using vpd = vector<pd>;
#define tcT template<class T
#define tcTU tcT, class U
tcT> using V = vector<T>;
tcT, size_t SZ> using AR = array<T,SZ>;
tcT> using PR = pair<T,T>;
// pairs
#define mp make_pair
#define f first
#define s second
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
#define len(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pb push_back
#define eb emplace_back
#define pf push_front
const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5;
const ll INF = 1e18; // not too close to LLONG_MAX
const ld PI = acos((ld)-1);
const int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1}; // for every grid problem!!
vl fields;
vl field_prefs;
ll getScore(int l, int r){
int m = (l+r)/2;
ll sm = 0;
sm += (m-l+1)*(fields[m-1]) - field_prefs[m]-field_prefs[l-1] ;
sm += field_prefs[r]-field_prefs[m] - (r-m)*fields[m-1];
return sm;
}
ll besthub(int R, ll L, vl X, ll B){
trav(i, X) fields.pb(i);
field_prefs.resize(R+1);
field_prefs[0] = 0;
F0R(i, R) field_prefs[i+1] = fields[i] + field_prefs[i];
int maxScore = 0;
FOR(left, 1 ,R+1){
FOR(right, left, R+1){
ll sm = getScore(left, right);
if (sm<=B){
maxScore = max(maxScore, right-left+1);
}
}
}
return maxScore;
}
int main(){
int R;
ll L, B;
cin >> R >> L >> B;
vl fd(R);
trav(i, fd) cin >> i;
cout << besthub(R, L, fd, B) << endl;
}
Compilation message
/usr/bin/ld: /tmp/ccvbdSQe.o: in function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccvZDbFg.o:ricehub.cpp:(.text.startup+0x0): first defined here
/usr/bin/ld: /tmp/ccvbdSQe.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
