题意
给定一个 N ∗ M N*M N∗M非负数字方格 w w w,从左上角到右下角,只能向右或者向下走,路径中的数字可以取走,但是总和不能超过 K K K,求最大路径和。
题目分析
典型的方格取数+01背包组合题。
定义状态 d p [ i ] [ j ] [ k ] dp[i][j][k] dp[i][j][k] 为走到第 i i i行第 j j j列容量为 k k k的最大路径和。
则状态转移方程为:
- k > = w [ i ] [ j ] k>=w[i][j] k>=w[i][j]时, d p [ i ] [ j ] [ k ] = m a x ( d p [ i − 1 ] [ j ] [ k − w [ i ] [ j ] ] , d p [ i ] [ j − 1 ] [ k − w [ i ] [ j ] ] ) + w [ i ] [ j ] dp[i][j][k] = max(dp[i-1][j][k-w[i][j]], dp[i][j-1][k-w[i][j]] ) + w[i][j] dp[i][j][k]=max(dp[i−1][j][k−w[i][j]],dp[i][j−1][k−w[i][j]])+w[i][j]
- k < w [ i ] [ j ] k<w[i][j] k<w[i][j]时, d p [ i ] [ j ] = m a x ( d p [ i − 1 ] [ j ] [ k ] , d p [ i ] [ j − 1 ] [ k ] ) dp[i][j] = max(dp[i-1][j][k] , dp[i][j-1][k]) dp[i][j]=max(dp[i−1][j][k],dp[i][j−1][k])
边界条件为:
- d p [ i ] [ j ] [ 0 ] = 0 dp[i][j][0] = 0 dp[i][j][0]=0
- d p [ 0 ] [ j ] [ k ] = d p [ i ] [ 0 ] [ k ] = 0 dp[0][j][k] = dp[i][0][k] = 0 dp[0][j][k]=dp[i][0][k]=0
int n,m,K;
int w[MAX][MAX];
int dp[MAX][MAX][MAX];
int cal(){
for(int i=1;i<=n;i++){
for(int j = 1;j<=m;j++){
for(int k=0;k<=K;k++){
if(k>=w[i][j]){
dp[i][j][k] = max(dp[i-1][j][k-w[i][j]],dp[i][j-1][k-w[i][j]])+w[i][j];
}else{
dp[i][j][k] = max(dp[i-1][j][k],dp[i][j-1][k]);
}
}
}
}
return dp[n][m][K];
}