资 源 简 介
一、问题的提出：
某厂根据计划安排，拟将n台相同的设备分配给m个车间，各车间获得这种设备后，可以为国家提供盈利Ci j(i台设备提供给j号车间将得到的利润，1≤i≤n，1≤j≤m) 。问如何分配，才使国家得到最大的盈利L
二．算法的基本思想：
利用动态规划算法的思想，设将i台设备分配给j－1个车间，可以为国家得到最大利润Li (j-1)(1≤i≤n，1≤j≤m)，那么将这i台设备分配给j个车间，第j个车间只能被分配到0～i台，所以我们只要算出当第j个车间分配到t(0<=t<=i)台时提供的最大利润Lt(j-1)+C(i-t)j，
-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, s
