【Luogu_P2254 [NOI2005] 瑰丽华尔兹【动态规划】【单调队列】

思路：

我们发现可以用DP，设f[k][i][j]表示第k时段走到i，j的最大路径
非常好转移啊
那我们发现算法时间复杂度瓶颈在于一个一个找最大的位置，用单调队列优化就行了。

$code$

#include<iostream>
#include<cstdio>
#include<cstring>
#define ll long long

using namespace std;

const ll MAXN = 2e3 + 5;
ll dx[5] = {0, -1, 1, 0, 0};
ll dy[5] = {0, 0, 0, -1, 1};

ll n, m, k, bx, by;
ll f[MAXN][MAXN];

string ma[MAXN];

struct node {
	ll v, w;
}q[MAXN];

void DP(ll x, ll y, ll l, ll d) {
	ll hd = 1, tl = 0, i = 0;
	while(1) {
		if(x < 1 || x > n || y < 1 || y > m) break;
		if(ma[x][y - 1] == 'x') { hd = 1; tl = 0; x += dx[d]; y += dy[d]; i ++; continue; }
		while(hd <= tl && q[tl].v + i - q[tl].w < f[x][y]) tl --;
		q[++ tl].v = f[x][y];
		q[tl].w = i;
		if(q[tl].w - q[hd].w > l) hd ++;
		f[x][y] = q[hd].v + i - q[hd].w;
		x += dx[d], y += dy[d], i ++;
	}
}

int main() {
	scanf("%lld%lld%lld%lld%lld", &n, &m, &bx, &by, &k);
	for(ll i = 1; i <= n; i ++) cin>>ma[i];
	memset(f, -0x3f, sizeof(f));
	f[bx][by] = 0;
	for(ll i = 1; i <= k; i ++) {
		ll s, t, d;
		scanf("%lld%lld%lld", &s, &t, &d);
		ll l = t - s + 1;
		if(d == 1) {
			for(ll j = 1; j <= m; j ++)
				DP(n, j, l, 1);
		}
		if(d == 2) {
			for(ll j = 1; j <= m; j ++)
				DP(1, j, l, 2);
		}
		if(d == 3) {
			for(ll j = 1; j <= n; j ++)
				DP(j, m, l, 3);
		}
		if(d == 4) {
			for(ll j = 1; j <= n; j ++)
				DP(j, 1, l, 4);
		}
	}
	ll ans = 0;
	for(ll i = 1; i <= n; i ++)
		for(ll j = 1; j <= m; j ++)
			ans = max(ans, f[i][j]);
	printf("%lld", ans);
	return 0;
}