hdu 5492

动态规划

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<time.h>
using namespace std;
#define inf 0x3f3f3f3f
int V[][],dp[][][];
int min(int a,int b){
    return a<b?a:b;
}
int main()
{
    freopen("input4.txt","r",stdin);
    freopen("output.txt","w",stdout);
    int start=clock();//从这开始计时
    int ca=,T,i,j,k,n,m;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&n,&m);
        for(i=;i<n;++i)
            for(j=;j<m;++j) scanf("%d",&V[i][j]);
            printf("Case #%d: ",ca++);
            memset(dp,inf,sizeof(dp));
            dp[][][V[][]]=V[][]*V[][];
            for(i=;i<n;++i)
                for(j=;j<m;++j)
                {
                    if(i+<n){
                        for(k=;k<=*;++k)
                            if(dp[i][j][k]!=inf)
                                dp[i+][j][k+V[i+][j]]=min(dp[i+][j][k+V[i+][j]],dp[i][j][k]+V[i+][j]*V[i+][j]);
                    }
                    if(j+<m){
                        for(k=;k<=*;++k)
                            if(dp[i][j][k]!=inf)
                                dp[i][j+][k+V[i][j+]]=min(dp[i][j+][k+V[i][j+]],dp[i][j][k]+V[i][j+]*V[i][j+]);
                    }
                }
                int ans=inf;
                for(i=;i<=*;++i)
                    if(dp[n-][m-][i]!=inf)
                        ans=min(ans,(n+m-)*dp[n-][m-][i]-i*i);
                    printf("%d\n",ans);
    }
    int end=clock();//到这结束
    printf("%d ms\n",end-start);//算出来的单位是毫秒
    return ;
}

#include<stdio.h>
#include<string.h>
#define inf 0x3f3f3f3f
int dp[][][];
int v[][];
int min(int a,int b){
    return a<b?a:b;
}
int main(){
    int t,n,m,cur=,i,j,k;
    //freopen("input4.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    scanf("%d",&t);
    while(t--){
        printf("Case #%d: ",cur++);
        scanf("%d %d",&n,&m);
        for(i=;i<=n;i++){
            for(j=;j<=m;j++)
                scanf("%d",&v[i][j]);
        }
        memset(dp,inf,sizeof(dp));
        dp[][][v[][]]=v[][]*v[][];
        for(i=;i<=n;i++){
            for(j=;j<=m;j++){
                if(j+<=m){//向右
                    for(k=;k<=*;k++){
                        if(dp[i][j][k]!=inf)
                            dp[i][j+][k+v[i][j+]]=min(dp[i][j+][k+v[i][j+]],dp[i][j][k]+v[i][j+]*v[i][j+]);
                    }
                }
                if(i+<=n){//向下
                    for(k=;k<=*;k++){
                        if(dp[i][j][k]!=inf)
                            dp[i+][j][k+v[i+][j]]=min(dp[i+][j][k+v[i+][j]],dp[i][j][k]+v[i+][j]*v[i+][j]);
                    }
                }

            }
        }
        int ans=inf;
        for(i=;i<=*;i++){
            if(dp[n][m][i]!=inf)
                ans=min(ans,(n+m-)*dp[n][m][i]-i*i);
        }
        printf("%d\n",ans);

    }
    return ;
}