解0-1背包问题的动态规划算法Knapsack如下,空缺代码是: for(int i=n-1; i>1;i++){ jMax=min(w[i]-1,c); for (int j=0; j<=jMax;j++) m[i][j]= m[i+1][j]; for (int j=w[n]; j<=c;j++) m[i][j]= ; }
A.
max( m[i+1][j] , m[i+1][ j ]+v[i] )
B.
max( m[i+1][j+1] , m[i+1][ j+w[i] ]+v[i] )
C.
max( m[i+1][j] , m[i+1][ j-w[i] ]+v[i] )
D.
max( m[i+1][j] , m[i+1][ j-v[i] ]+w[i] )