100ptsWA on hack #1

#include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 1e2;
int n,l,r,a[N],j,ans,f[N];
int q[N],last = -1,first = 0;
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    cin >> n >> l >> r;
    for(int i = 0;i <= n;i ++) cin >> a[i];
    for(int i = 1;i <= n;i ++) f[i] = INT_MIN;
    for(int i = 1;i <= n + r;i ++) {
        while(i - j >= l && j < i) {
            if(f[j] != INT_MIN) {
                while(f[q[last]] <= f[j] && first <= last) last --;
                q[++ last] = j;
            }
            j ++;
        }
        while(i - q[first] > r && first <= last) first ++;
        if(first <= last) f[i] = a[i] + f[q[first]];
    }
    // for(int i = 1;i < n + r;i ++) cout << f[i] << ' ';
    // cout << '\n';
    for(int i = n + 1;i <= n + r;i ++) ans = max(ans,f[i]);
    cout << ans << '\n';
    return 0;
}