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

Packet : 43680528plan.rar filelist
用动态规划法求解资源分配问题\Project1.~bpr
用动态规划法求解资源分配问题\Project1.cpp
用动态规划法求解资源分配问题\Project1.exe
用动态规划法求解资源分配问题\Project1.obj
用动态规划法求解资源分配问题\Project1.res
用动态规划法求解资源分配问题\Project1.~cpp
用动态规划法求解资源分配问题\Unit1.obj
用动态规划法求解资源分配问题\Project1.tds
用动态规划法求解资源分配问题\Unit1.~cpp
用动态规划法求解资源分配问题\Unit1.~h
用动态规划法求解资源分配问题\Unit1.~dfm
用动态规划法求解资源分配问题\Unit1.~ddp
用动态规划法求解资源分配问题\Unit1.cpp
用动态规划法求解资源分配问题\Unit1.h
用动态规划法求解资源分配问题\Unit1.dfm
用动态规划法求解资源分配问题\Unit1.ddp
用动态规划法求解资源分配问题\Project1.bpr
用动态规划法求解资源分配问题

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．