单调队列优化dp

题意

n个点 每个点有个权值 每m个点之间必须选一个点
求最小代价 （选点的代价就为权值

#include <bits/stdc++.h>
using namespace  std;
//#define  int long long
//typedef long long ll;
typedef pair<int,int> pii;
#define x first 
#define y second
#define pb  push_back
#define inf 1e18
#define IOS   std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define  fer(i,a,b)  for(int i=a;i<=b;i++)
#define  der(i,a,b)  for(int i=a;i>=b;i--) 
 
const int mod=1e9+7;
/*ll qsm(int a,int b)
{ll res=1;  while(b){  if(b&1) res=res*a%mod;  a=a*a%mod;  b>>=1; } return res;}
*/
const int N=4e5+10;
int n,m;
int k;
int a[N];
int dp[N];
int q[N];
void solve()
{
	cin>>n;
	fer(i,1,n)cin>>a[i];
	int hh=0,tt=0;
	fer(i,1,n)
	{
	while(hh<=tt)
	{
		if(q[hh]<i-m)hh++;
		dp[i]=dp[q[hh]]+a[i];
		while(hh<=tt&&dp[q[tt]]>=dp[i])tt--;
	    q[++tt]=i;
	}
	
    }
    int ans=inf;
	fer(i,n-m+1,n)dp[i]=min(dp[i],ans);
}

int main()
{
	IOS;
	int _=1;
    
	//cin>>_;
	while(_--) solve();
	return 0;
}