HDU 1712 - ACboy needs your help
Problem : One has M spaces, and has N items. each item has M+1 types with space 0 to M and value a[i][j]. Put them to the M spaces and get the maximum value.
Solution : f[i][j] is put the first i items with j space. then f[i][j]=max{ f[i-1][k]+a[i][j-k] | 0<=k<=j }. (Knapsack with some item has conflict).