hdu 5092 Seam Carving （简单数塔DP，题没读懂，，不过可以分析样例）

int T,m,n;
int a[105][105], f[105][105];
int path[105];

int main(){
    cin>>T;
    rep(t,1,T){
        scanf("%d%d",&m,&n);
        rep(i,1,m) rep(j,1,n) scanf("%d",&a[i][j]);
        mem(f,inf);
        rep(j,1,n) f[1][j]=a[1][j];
        rep(i,2,m){
            rep(j,1,n){
                int y;
                y=j-1; if(y>=1 && f[i-1][y]+a[i][j]<=f[i][j]) f[i][j]=f[i-1][y]+a[i][j];
                y=j;   if(y>=1 && f[i-1][y]+a[i][j]<=f[i][j]) f[i][j]=f[i-1][y]+a[i][j];
                y=j+1; if(y<=n && f[i-1][y]+a[i][j]<=f[i][j]) f[i][j]=f[i-1][y]+a[i][j];
            }
        }

        int mins=inf, minsp=-1;
        rep(i,1,n) if(f[m][i]<=mins) mins=f[m][i],minsp=i;
        path[m]=minsp;
        rep2(i,m-1,1){
            int v=path[i+1];
            int temp=inf, tempP;
            if(v+1<=n && f[i][v+1]<temp) temp=f[i][v+1],tempP=v+1;
            if(f[i][v]<temp) temp=f[i][v], tempP=v;
            if(v-1>=1 && f[i][v-1]<temp) temp=f[i][v-1],tempP=v-1;
            path[i]=tempP;
        }
        printf("Case %d\n",t);
        rep(i,1,m-1) printf("%d ",path[i]); printf("%d\n",path[m]);
    }
}