Description: Double-ended queue used in optimization algorithms to solve race problems: the title says, Mr Pote has n in bags of beans. Mr Pote from which to choose packaging requirements to find continuous one bag of beans makes them the sum of s to meet the s p < = k under the condition of the maximum to the minimum guaranteed to be eaten by dogs, and Mr. Pote filled with beans up . Finally, output the number of dogs eat the beans, that s p result. After the abstract is stated as: given n, p, k, and n the number of items listed [wi], requires a continuous sequence to identify its make and s to meet their s p < = k under the conditions of maximum output s divisible p results.
To Search:
File list (Check if you may need any files):
shuangduandui\Debug\shuangduandui.exe
.............\.....\shuangduandui.ilk
.............\.....\shuangduandui.pdb
.............\shuangduandui\Debug\BuildLog.htm
.............\.............\.....\duilie.obj
.............\.............\.....\mt.dep
.............\.............\.....\shuangduandui.exe.embed.manifest
.............\.............\.....\shuangduandui.exe.embed.manifest.res
.............\.............\.....\shuangduandui.exe.intermediate.manifest
.............\.............\.....\vc90.idb
.............\.............\.....\vc90.pdb
.............\.............\duilie.cpp
.............\.............\shuangduandui.vcproj
.............\.............\shuangduandui.vcproj.THINK.Csy.user
.............\shuangduandui.ncb
.............\shuangduandui.sln
.............\shuangduandui.suo
.............\.............\Debug
.............\Debug
.............\shuangduandui
shuangduandui
Download