题目大意:
给定n∗m(n+m为奇数)的矩阵,从(1,1)走到(n,m)且只能往右往下走,设经过的数为a1,a2,a3,a4.....ak-1,ak a2...a2k,贡献为a1∗a2+a3∗a4+...+ak−1∗ak求最小贡献。解题思路:动态规划(dp)/记忆化搜索,注意只有在i+j是奇数的时候才能进行状态转移,因为从这步走到下个奇数格子 的必须要两步,因此有四个状态转移方程: d[i][j]=min(d[i][j],a[i][j]*a[i-1][j]+ solve(i-1,j-1)); d[i][j]=min(d[i][j],a[i][j]*a[i][j-1]+solve(i-1,j-1)); d[i][j]=min(d[i][j],a[i][j]*a[i-1][j]+solve(i-2,j)); d[i][j]=min(d[i][j],a[i][j]*a[i][j-1]+solve(i,j-2)); 注意点:这道题要注意的点有以下几个: 1.状态变量必须是long long。 2.当边沿状态的时候,只能有一种状态转移 3.还有个点我忘了。。。(好像也可以用迭代写)
#include<cstdio> #include<cstring> #include<algorithm> #include<iostream> using namespace std; const int maxn=1000+200; int a[maxn][maxn]; long long d[maxn][maxn]; int m,n; long long solve(int i,int j) { if(d[i][j]!=(1<<30)) return d[i][j];//记忆化搜索 if (i>1&&j>1) { d[i][j]=min(d[i][j],a[i][j]*a[i-1][j]+ solve(i-1,j-1)); d[i][j]=min(d[i][j],a[i][j]*a[i][j-1]+solve(i-1,j-1)); if(i-2>0) d[i][j]=min(d[i][j],a[i][j]*a[i-1][j]+solve(i-2,j)); if(j-2>0) d[i][j]=min(d[i][j],a[i][j]*a[i][j-1]+solve(i,j-2)); } else if(i==1&&j-2>=0) { d[i][j]=min(d[i][j],a[i][j]*a[i][j-1]+solve(i,j-2)); } else if(j==1&&i-2>=0) { d[i][j]=min(d[i][j],a[i][j]*a[i-1][j]+solve(i-2,j)); } return d[i][j]; } int main() { while(~scanf("%d%d",&n,&m)) { memset(d,-1,sizeof(d)); for(int i=1; i<=n; i++) for(int j=1; j<=m; j++) { scanf("%d",&a[i][j]); d[i][j]=(1<<30); } d[0][0]=d[0][1]=d[1][0]=0;//起点 solve(n,m); printf("%lld\n",d[n][m]); } return 0; }