Description: A company intends to assign some equipment 5 A, between B, C 3 plants, factories profits and the number of devices in the following table, asking how to allocate 5 device so that the total profits for the three plants Maximum? dynamic programming algorithm classic example here to do further optimization and implementation.
To Search:
File list (Check if you may need any files):
zx_最优分配.cpp
Download