#include "holiday.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 1e5 + 5;
int n, a[maxn];
int solve(int S, int d) {
int ans = 0, curans = 0;
priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;
for (int i=S;i<=n;i++) {
pq.push({a[i], -i}), curans += a[i];
while (pq.size() > 0 && i-S + pq.size() > d) {
curans -= pq.top().first;
pq.pop();
}
ans = max(curans, ans);
}
while (pq.size() > 0) pq.pop();
curans = 0;
set<int> s;
for (int i=S;i<=n;i++) {
pq.push({a[i], -i}), s.insert(i), curans += a[i];
while (pq.size() > 0 && i-S + pq.size() > d) {
curans -= pq.top().first;
s.erase(-pq.top().second);
pq.pop();
}
if (curans==ans) break;
}
for (int i=S-1, D = d-1; i>=1 && D>=1; i--, D--) {
pq.push({a[i], -i}), s.insert(i), curans += a[i];
while (pq.size() > 0 && *s.rbegin()-i + pq.size() > D) {
curans -= pq.top().first;
s.erase(-pq.top().second);
pq.pop();
}
ans = max(curans, ans);
}
return ans;
}
int findMaxAttraction(int32_t N, int32_t S, int32_t D, int32_t A[]) {
n = N, S++;
for (int i=1;i<=n;i++) a[i] = A[i-1];
int ans1 = solve(S, D);
reverse(a+1, a+n+1); S = n+1-S;
int ans2 = solve(S, D);
return max(ans1, ans2);
}
