Description: Programming the dynamic programming algorithm for knapsack problem. Input requirements: first line: the number of objects N backpack load of M (N, M ≥ 1) the first i-line: the first i-1 the value of the weight of objects (i = 2,3, ..., N+1)
To Search:
- [DP] - it introduce the dinamic programming alg
File list (Check if you may need any files):
动态\Debug\StdAfx.obj
....\.....\vc60.idb
....\.....\vc60.pdb
....\.....\动态.exe
....\.....\动态.ilk
....\.....\动态.obj
....\.....\动态.pch
....\.....\动态.pdb
....\ReadMe.txt
....\StdAfx.cpp
....\StdAfx.h
....\动态.cpp
....\动态.dsp
....\动态.dsw
....\动态.ncb
....\动态.opt
....\动态.plg
....\Debug
动态
Download