POJ 2353 Ministry DP

很经典的DP，做法就不多说了。我只是想吐槽，为什么该WA的判的是OLE...

//#pragma comment(linker, "/STACK:102400000,102400000")
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<cmath>
#include<cctype>
#include<string>
#include<algorithm>
#include<iostream>
#include<ctime>
#include<map>
#include<set>
using namespace std;
#define MP(x,y) make_pair((x),(y))
#define PB(x) push_back(x)
typedef long long LL;
//typedef unsigned __int64 ULL;
/* ****************** */
const int INF=100011122;
const double INFF=1e100;
const double eps=1e-8;
const int mod=1000000009;
const int NN=300010;
const int MM=1000010;
/* ****************** */

LL dp[105][505];
int pre[105][505];
int a[105][505];
LL sum[505];
int lu[105*505];

void FF(int n,int id,int m)
{
    int i,j,tol=0;
    lu[++tol]=id;
    for(i=n-1;i>=1;i--)
    {
        if(pre[i+1][id]<id)
        {
            for(j=id;j>=pre[i+1][id];j--)
                lu[++tol]=j;
        }
        else
        {
            for(j=id;j<=pre[i+1][id];j++)
                lu[++tol]=j;
        }
        id=pre[i+1][id];
    }
    lu[tol+1]=-1;
    for(i=tol;i>=1;i--)
    {
        printf("%d\n",lu[i]);
    }
}

int main()
{
    int n,m;
    int i,j,id;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        memset(pre,0,sizeof(pre));

        for(i=1;i<=n;i++)
            for(j=1;j<=m;j++)
                scanf("%d",&a[i][j]);
        for(j=1;j<=m;j++)
        {
            dp[0][j]=0;
            a[0][j]=0;
        }

        for(i=1;i<=n;i++)
        {
            sum[0]=0;
            for(j=1;j<=m;j++)
                sum[j]=a[i-1][j]+sum[j-1];
            dp[i][1]=dp[i-1][1]+a[i-1][1];
            pre[i][1]=id=1;
            for(j=2;j<=m;j++)
            {
                if(dp[i-1][id]-sum[id-1] > dp[i-1][j]-sum[j-1])
                    id=j;
                dp[i][j]=dp[i-1][id]-sum[id-1]+sum[j];
                pre[i][j]=id;
            }

            id=-1;
            for(j=m;j>=1;j--)
            {
                if(id==-1 || ( dp[i-1][id]+sum[id] > dp[i-1][j]+sum[j] ))
                    id=j;
                if(dp[i-1][id]+sum[id]-sum[j-1]<dp[i][j])
                {
                    dp[i][j]=dp[i-1][id]+sum[id]-sum[j-1];
                    pre[i][j]=id;
                }
            }
        }
        id=-1;
        for(j=1;j<=m;j++)
        {
            if(id==-1 || dp[n][j]+a[n][j]<dp[n][id]+a[n][id])
            {
                id=j;
            }
        }
        FF(n,id,m);
    }
    return 0;
}