摘要：
Problem DescriptionNowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know 阅读全文
摘要：
Problem Description Before ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this actio 阅读全文
摘要：
Problem Description ACboy has N courses this term,and he plans to spend at most M days on study.Of course,the profit he will gainfrom different course 阅读全文
摘要：
01背包问题 有N件物品和一个容量为V的背包。第i件物品的费用是c[i]，价值是w[i]。求解将哪些物品装入背包可使价值总和最大。 01是指每个物品选0或1个。 选或不选体现在，剩下重量选后边的。前边的没选所以才能剩下重量。 子问题：容量为1-V的背包装哪些能使价值总和最大。 阅读全文