#include"holiday.h"
#include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define sol (k+k)
#define sag (k+k+1)
#define orta ((bas+son)/2)
#define coc g[node][i]
#define mod 1000000007
#define inf 1000000009
#define N 1000005
using namespace std;
typedef long long ll;
typedef pair < ll , ll > ii;
ll n, m, s, d, bas, son, ans, amk, a[N], ne[N], seg[4*N], say[4*N];
map < ll , ll > h, x;
map < ll , ll > :: iterator it;
void up(ll k, ll bas, ll son, ll x, ll y){
if(bas == son){
// cout << ne[bas] << " geldi bidane" << " " << y << endl;
say[k] += y;
seg[k] += y*ne[bas];
return;
}
if(x <= orta)
up(sol, bas, orta, x, y);
else
up(sag, orta + 1, son, x, y);
say[k] = say[sol] + say[sag];
seg[k] = seg[sol] + seg[sag];
}
ll qu(ll k, ll bas, ll son, ll x){
if(bas == son)
return min(x, say[k])*ne[bas];
if(say[sag] <= x)
return seg[sag] + qu(sol, bas, orta, x - say[sag]);
return qu(sag, orta + 1, son, x);
}
void getir(ll bs, ll sn){
// cout << "ofamk" << bs << " " << sn << endl;
while(bas < bs){
up(1, 1, m, x[a[bas]], -1);
bas++;
}
while(bas > bs){
bas--;
up(1, 1, m, x[a[bas]], 1);
}
while(son > sn){
up(1, 1, m, x[a[son]], -1);
son--;
}
while(son < sn){
son++;
up(1, 1, m, x[a[son]], 1);
}
}
void coz(ll bas, ll son, ll optl, ll optr){
// cout << bas << " " << son << " " << optl << " " << optr << " -> ";
// amk++;if(amk > 100)exit(0);
if(bas > son)return;
ii mx = mp(0, optr);
for(ll i = optl; i <= optr; i++){
if(i > orta)
break;
ll k = d - ((orta - s) + (orta - i));
if(k < 0){
mx.nd = i;
continue;
}
// cout << " gele " << i << " " << orta << endl;
getir(i, orta);
// cout << i << " " << orta << " den " << k << " tane -> " << qu(1, 1, m, k) << endl;
mx = max(mx, mp(qu(1, 1, m, k), i));
}
ans = max(ans, mx.st);
// cout << mx.st<< " " << mx.nd << "\n" << bas << " " << orta - 1 << " " << optl << " " << mx.nd << endl;
// cout << orta + 1 << " " << son << " " << mx.nd << " " << optr << endl;
coz(bas, orta - 1, optl, mx.nd);
coz(orta + 1, son, mx.nd, optr);
}
ll findMaxAttraction(int n, int ss, int dd, int aa[]){s = ss + 1;d = dd;
for(ll i = 1; i <= n; i++){
a[i] = aa[i - 1];
h[a[i]] = 1;
}
for(it = h.begin(); it != h.end(); it++){
x[it->st] = ++m;
ne[m] = it->st;
}
// for(ll i = 1; i <= m; i++)cout << ne[i] << " ";cout << endl;
bas = son = 1;up(1, 1, m, x[a[1]], 1);
coz(s, n, 1, n);
getir(1, 1);
up(1, 1, m, x[a[1]], -1);
reverse(a + 1, a + n + 1);
up(1, 1, m, x[a[1]], 1);
s = n - s + 1;
coz(s, n, 1, n);
return ans;
}
// int main() {
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
// ll n, start, d;
// ll attraction[100000];
// ll i, n_s;
// n_s = scanf("%lld %lld %lld", &n, &start, &d);
// for (i = 0 ; i < n; ++i) {
// n_s = scanf("%lld", &attraction[i]);
// }
// printf("%lld\n", findMaxAttraction(n, start, d, attraction));
// return 0;
// }
