摘要：
Maximum subarray problem The maximum subarray problem is the task of finding the contiguous subarray within a one-dimensional array, a[1...n], of numb 阅读全文
摘要：
Integer Partition In number theory and combinatorics, a partition of a positive integer n, also called an integer partition, is a way of writing nas a 阅读全文
摘要：
中文理解： 0-1背包问题：有一个贼在偷窃一家商店时，发现有n件物品，第i件物品价值vi元，重wi磅，此处vi与wi都是整数。他希望带走的东西越值钱越好，但他的背包中至多只能装下W磅的东西，W为一整数。应该带走哪几样东西？这个问题之所以称为0-1背包，是因为每件物品或被带走；或被留下；小偷不能只带走 阅读全文
摘要：
Longest Increasing Subsequence The longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence's elem 阅读全文