Introduction - If you have any usage issues, please Google them yourself
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.