hdu 2571 dp+dfs 命运

dfs+dp

dp[i][j]表示从map[i][j] 到map[n][m]的最大值。

#include<iostream>using namespace std;#define MIN -0x7fffffffint dp[25][1005];int n,m;int map[25][1005];int dfs(int r,int c){if(dp[r][c]>MIN) return dp[r][c];int t=MIN,tmp;if(r+1<=n){tmp=dfs(r+1,c);t=tmp>t?tmp:t;}if(c+1<=m){tmp=dfs(r,c+1);t=tmp>t?tmp:t;}for(int i=2;c*i<=m;i++){tmp=dfs(r,c*i);t=tmp>t?tmp:t;}return dp[r][c]=map[r][c]+t;}int main(){int t;scanf("%d",&t);while(t--){scanf("%d %d",&n,&m);for(int i=1;i<=n;i++)for(int j=1;j<=m;j++){scanf("%d",&map[i][j]);dp[i][j]=MIN;}dp[n][m]=map[n][m];printf("%d\n",dfs(1,1));}}