uva 1427(单调队列优化dp)

题意：一个城市有n+1个横向路和m+1个纵向路，一个国王从最北边的进入，然后沿某种路线从最南边出去，每小段横向路都有一个高兴值，但国王不会在某条横向路待超过k分钟，问国王可以得到的最大的高兴值是多少。

题解：f[i][j]表示走前i行前j列的最大高兴值，因为从最北边进入的方式有两种：从左进入或从右进入，所以要分情况讨论。直接针对每个点来算左右两方向会超时，这题想到用到队列优化比较难，看了这位大神的题解，比较详细细。http://blog.csdn.net/hei_nero/article/details/10643893

#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <queue>
using namespace std;
const int N = 105;
const int M = 10005;
struct Node {
    int val, ti;
    Node() {}
    Node(int x, int y):val(x), ti(y) {}
}node;
int n, m, k, val[N][M], t[N][M], sumv[N][M], sumt[N][M], f[N][M];
deque<Node> q;

int main() {
    while (scanf("%d%d%d", &n, &m, &k) == 3 && n + m + k) {
        memset(f, 0, sizeof(f));
        n++;
        for (int i = 1; i <= n; i++) {
            sumv[i][0] = 0;     
            for (int j = 1; j <= m; j++) {
                scanf("%d", &val[i][j]);
                sumv[i][j] = sumv[i][j - 1] + val[i][j];
            }
        }
        for (int i = 1; i <= n; i++) {
            sumt[i][0] = t[i][m + 1] = 0;
            for (int j = 1; j <= m; j++) {
                scanf("%d", &t[i][j]);
                sumt[i][j] = sumt[i][j - 1] + t[i][j];
            }
        }
        for (int i = 1; i <= n; i++) {
            q.clear();
            for (int j = 0; j <= m; j++) {
                int temp = f[i - 1][j] - sumv[i][j];
                while (!q.empty() && q.front().val <= temp)
                    q.pop_front();
                q.push_front(Node(temp, sumt[i][j]));
                while (!q.empty() && q.front().ti - q.back().ti > k)
                    q.pop_back();
                f[i][j] = q.back().val + sumv[i][j];
            }
            q.clear();
            int tt = 0;
            for (int j = m; j >= 0; j--) {
                tt += t[i][j + 1];
                int temp = f[i - 1][j] + sumv[i][j];
                while (!q.empty() && q.front().val <= temp)
                    q.pop_front();
                q.push_front(Node(temp, tt));
                while (!q.empty() && q.front().ti - q.back().ti > k)
                    q.pop_back();
                f[i][j] = max(f[i][j], q.back().val - sumv[i][j]);
            }
        }
        int res = -1;
        for (int i = 0; i <= m; i++)
            res = max(res, f[n][i]);
        printf("%d\n", res);
    }
    return 0;
}