HDU 4374

居然在初始化上出错了，害我WA了好多次。。。。

#include<iostream>
#include<cstdio>
#include<deque>
#include<algorithm>
#define MAXN 104
#define MAXM 10004
#define MIN (1<<31)
using namespace std;
struct part {
    int prev;
    int p,id;
    void ini(int a, int b, int c)
    {
        p = a;id = b;prev = c;     
    }       
}data[MAXN][MAXM],temp;
int dp[MAXN][MAXM];
int sum[MAXM];

void prepare(int n, int m, int x, int t)
{
    sum[0] = 0;
    for (int j(1); j<=m; ++j)sum[j] = sum[j-1] + data[0][j-1].p; 
    for (int i(0); i<MAXN; ++i)
        for (int j(0); j<MAXM; ++j)
            dp[i][j] = MIN;     
    for (int i(0); i<m; ++i) {
        if (abs(i-x)<=t) {                 
            dp[0][i] = sum[max(i,x)+1] - sum[min(i,x)];
        }
    }
}

int main()
{
    int n,m,x,t;
    while (scanf("%d%d%d%d",&n,&m,&x,&t) != EOF) {
        for (int i(0); i<n; ++i) {
            for (int j(0); j<m; ++j) {
                scanf("%d",&data[i][j].p);
                data[i][j].id = j;    
            }
        }
        --x;
        prepare(n,m,x,t);  
        for (int i(1); i<n; ++i) {              
            sum[0] = 0;
            for (int j(1); j<=m; ++j)sum[j] = sum[j-1] + data[i][j-1].p;              
            int fi(0),se(0),k(0);
            deque<part> Q;
            for (int j(0); j<m; ++j) {
                fi = j;
                while (!Q.empty() && Q.front().id < j)Q.pop_front();
                for (; k<m && j+t>=k; ++k) {
                    if (dp[i-1][k] == MIN)continue;
                    temp.ini(dp[i-1][k]+sum[k+1]-sum[j],k,j);
                    if (!Q.empty())se = Q.back().prev;
                    while (!Q.empty() && Q.back().p - (sum[fi] - sum[se]) < temp.p) {
                        Q.pop_back();
                        if (!Q.empty())se = Q.back().prev;        
                    }   
                    Q.push_back(temp); 
                }
                if (!Q.empty())se = Q.front().prev;
                if (!Q.empty())dp[i][j] = max(dp[i][j],Q.front().p - (sum[fi] - sum[se]));
            }
            k = 0;Q.clear();
            for (int j(0); j<m; ++j) {
                fi = j + 1;
                while (!Q.empty() && Q.front().id + t < j)Q.pop_front();
                for (; k<=j; ++k) {
                    if (dp[i-1][k] == MIN)continue;
                    temp.ini(dp[i-1][k]+sum[j+1]-sum[k],k,j);
                    if (!Q.empty())se = Q.back().prev + 1;
                    while (!Q.empty() && Q.back().p + sum[fi] - sum[se] < temp.p) {
                        Q.pop_back();
                        if (!Q.empty())se = Q.back().prev + 1;          
                    }    
                    Q.push_back(temp);
                }
                if (!Q.empty())se = Q.front().prev + 1; 
                if (!Q.empty())dp[i][j] = max(dp[i][j],Q.front().p + sum[fi] - sum[se]); 
            }                                  
        }    
        int ans(MIN);
        for (int i(0); i<m; ++i) {
            ans = max(dp[n-1][i],ans);    
        }
        cout<<ans<<endl;
    }
    return 0;    
}