Hdu 1712 ACboy needs your help

Question:

Link: Click to open the link

Question:

N courses are completed in m days. a [I] [j] indicates the value obtained by completing the I-th course in j days, and the greatest value is obtained.

Algorithm:

Group backpack.

Ideas:

M days are the total capacity, and n is the number of groups.

Code:

# Include

 
  
# Include

  
   
# Include

   
    
Using namespace std; int n, m; int a [110] [110]; int dp [110]; int main () {// freopen ("input.txt ", "r", stdin); while (scanf ("% d", & n, & m )! = EOF & (n | m) {memset (a, 0, sizeof (a); for (int I = 0; I

    
     
= 0; j --) {for (int k = 1; k <= m; k ++) {if (j> = k) // determine if k is less than the number of remaining days j's dp [j] = max (dp [j], dp [j-k] + a [I] [k]) ;}} printf ("% d \ n", dp [m]);} return 0 ;}