Introduction - If you have any usage issues, please Google them yourself
First, the problem: a factory according to schedule, the proposed n Taiwan, the same equipment m allocated to the workshop, the workshop was such a device can provide a profit for the state Ci j (i piece of equipment available to the workshop will be No. j profits, 1 ≤ i ≤ n, 1 ≤ j ≤ m). How to allocate the question before the country to obtain the greatest profit of L 2. Algorithm the basic idea: the use of dynamic programming algorithm based i piece of equipment will be allocated to the j-1 workshop, you can get maximum profits for the state Li (j-1) (1 ≤ i ≤ n, 1 ≤ j ≤ m) , then the i piece of equipment assigned to the j of the workshop, the first workshop j can only be assigned to the 0 ~ i-Taiwan, so we only calculate when the first workshop j assigned to t (0