UVA Live Achrive 4327 Parade (单调队列,dp)

#include<bits/stdc++.h>
using namespace std;

const int N = 102, M = 1e4+5;
int n, m, k;
int h[N][M], t[N][M];
int dp[N][M];
int q[M];

//#define LOCAL
int main()
{
#ifdef LOCAL
    freopen("in.txt","r",stdin);
#endif
    while(scanf("%d%d%d", &n, &m, &k), n+m+k){
        n++;
        for(int i = 1; i <= n; i++){
            for(int j = 1; j <= m ;j++){
                scanf("%d",h[i]+j);
                h[i][j] += h[i][j-1];
            }
        }
        for(int i = 1; i <= n; i++){
            for(int j = 1; j <= m ;j++){
                scanf("%d",t[i]+j);
                t[i][j] += t[i][j-1];
            }
        }

        for(int i = 1; i <= n; i++){
            #define maintain(diff) while(hd<rl && diff(j,q[hd]) > k) hd++;
            #define inst(val) while(hd<rl && val(q[rl-1]) <= val(j)) rl--; q[rl++] = j;
            int hd = 0, rl = 0;
            #define dis(x) (t[i][x])
            #define lval(x) (dp[i-1][x] - h[i][x])
            #define ldis(j,k) dis(j)-dis(k)
            for(int j = 0; j <= m; j++){
                inst(lval)
                maintain(ldis)
                dp[i][j] = lval(q[hd])+h[i][j];
            }
            hd = rl = 0;
            #define rval(x) (dp[i-1][x] + h[i][x])
            #define rdis(j,k) dis(k)-dis(j)
            for(int j = m; j >= 0; j--){
                inst(rval)
                maintain(rdis)
                dp[i][j] = max(dp[i][j],rval(q[hd])-h[i][j]);
            }
        }
        int ans = 0;
        for(int j = 0; j <= m; j++){
            ans = max(ans,dp[n][j]);
        }
        printf("%d\n",ans);
    }
    return 0;
}