烽火传递（单调队列优化动规）

首先裸动规 

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
int f[100500],a[100500];
int n,m;
int main() {
	int ans=0x7f7f7f7f;
	memset(f, 127, sizeof(f));
	scanf("%d%d", &n, &m);
	f[0] = 0;
	for(int i = 1; i <= n; i++) 
        scanf("%d",&a[i]);
    for(int i = 1; i <= n; i++) 
		for(int j = i - m; j < i; j++) {
		    f[i] = min(f[i], f[j]+a[i]);	
	    }
    for(int i = n - m + 1; i <= n; i++) 
    	ans = min(ans, f[i]);
    printf("%d", ans);
    return 0;
}

考虑优化…

双层循环非吾愿 这时第二层循环的作用：找前m个的最小值

我们看到了事情的转机

此时想到单调队列解决RMQ

错点明确：单调队列的q存的是什么变量意义

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
int f[100500],a[100500];
int q[100500];
int n,m;
int main() {
	int ans=0x7f7f7f7f;
	int head=1,tail=1;
	memset(f, 127, sizeof(f));
	scanf("%d%d", &n, &m);
	f[0] = 0;
	for (int i = 1; i <= n; i++) scanf("%d",&a[i]);
    for (int i = 1; i <= n; i++) {
    	f[i] = f[q[head]] + a[i];
		while(head <= tail && f[i] <= f[q[tail]]) tail--;
		q[++tail]=i;
		while (q[head] < i + 1 - m ) head++;
	}
    printf("%d", f[q[head]]);
    return 0;
}