#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
const int mxn=1e5+5;
multiset<int>bg,sm;
int n,st,d,L,R;
long long cur,v[mxn];
void sir(int l,int r,int k){
while(L>l){
bg.insert(v[--L]);
cur+=v[L];
while(sz(bg) and sz(bg)>k){
cur-=*bg.begin();
sm.insert(*bg.begin());
bg.erase(bg.begin());
}
}
while(R<r){
bg.insert(v[++R]);
cur+=v[R];
while(sz(bg) and sz(bg)>k){
cur-=*bg.begin();
sm.insert(*bg.begin());
bg.erase(bg.begin());
}
}
while(L<l){
if(bg.find(v[L])!=bg.end()){
cur-=v[L];
bg.erase(bg.find(v[L]));
}
else{
sm.erase(sm.find(v[L]));
}
while(sz(sm) and sz(bg)<k){
cur+=*prev(sm.end());
bg.insert(*prev(sm.end()));
sm.erase(prev(sm.end()));
}
L++;
}
while(R>r){
if(bg.find(v[R])!=bg.end()){
cur-=v[R];
bg.erase(bg.find(v[R]));
}
else{
sm.erase(sm.find(v[R]));
}
while(sz(sm) and sz(bg)<k){
cur+=*prev(sm.end());
bg.insert(*prev(sm.end()));
sm.erase(prev(sm.end()));
}
R--;
}
}
long long ans;
void solve(int l,int r,int ql,int qr){
debug(l,r,ql,qr);
if(l>r){
return;
}
int mm=l+r>>1;
long long mx=-1;
int best=-1;
for(int i=max(ql,mm);i<=qr;i++){
int x=max(0,d-(min(i-st,st-mm)+i-mm));
sir(mm,i,x);
if(mx==-1 or cur>mx){
best=i;
mx=cur;
}
}
chmax(ans,mx);
if(l==mm)return;
solve(l,mm,ql,best);
solve(mm+1,r,best,qr);
}
long long findMaxAttraction(int N,int ST,int D,int a[]){
n=N,st=ST,d=D;
for(int i=0;i<n;i++){
v[i]=a[i];
}
bg.insert(v[0]);
cur+=v[0];
sir(0,n-1,n);
solve(0,n-1,0,n-1);
return ans;
}
#ifdef local
int main(){
setio();
int a,b,c;
cin>>a>>b>>c;
int x[n];
for(int i=0;i<a;i++){
cin>>x[i];
}
cout<<findMaxAttraction(a,b,c,x)<<'\n';
}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
/*
input:
*/
Compilation message
holiday.cpp: In function 'void solve(int, int, int, int)':
holiday.cpp:101:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
101 | int mm=l+r>>1;
| ~^~
holiday.cpp: At global scope:
holiday.cpp:141:6: error: redefinition of 'void setio()'
141 | void setio(){}
| ^~~~~
holiday.cpp:37:6: note: 'void setio()' previously defined here
37 | void setio(){}
| ^~~~~
