我的单调队列被单调队列了

#include <bits/stdc++.h>
#define f(q) !q.empty()
using namespace std;
long long n,k,a[100010],sum[100010],dp[100010],ans;
//dp[i]表示前i个不选i的最大值 
deque<int> q;
int main(){
	//ios::sync_with_stdio(0);
	//cin.tie(0);
	//cout.tie(0);
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		sum[i]=sum[i-1]+a[i];
	}
	//q.push_back(0);
	for(int i=1;i<=k+1;i++){
		dp[i]=sum[i-1];
		q.push_back(i);
	}
	// dp[i]=max(dp[i],dp[j]-sum[j])+sum[i-1]
	//dp[j]-sum[j]放入单调队列 
	for(int i=2+k;i<=n+1;i++){
		while(f(q)&&q.front()+k+1<i) q.pop_front();
		dp[i]=dp[q.front()]+sum[i-1]-sum[q.front()];
		long long tmp=dp[i]-sum[i];
		while(f(q)&&dp[q.back()]-sum[q.back()]<=tmp) q.pop_back();
		q.push_back(i);
	}
	cout<<dp[n+1];
	return 0;
}