动态规划
Adamaomaoo
这个作者很懒,什么都没留下…
展开
-
Wooden Sticks
There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some time, called原创 2014-08-20 19:05:43 · 365 阅读 · 0 评论 -
Common Subsequence
Time Limit: 1000msMemory Limit: 10000KB 64-bit integer IO format: %lld Java class name: Main Submit Status A subsequence of a given sequence is the given sequence with some elements (possible none)原创 2014-08-16 17:20:46 · 400 阅读 · 0 评论 -
poj2533Longest Ordered Subsequence
A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 < i2 < ... < iK <= N.原创 2014-08-16 18:03:17 · 474 阅读 · 0 评论 -
skiing(动态规划)
skiing 时间限制:3000 ms | 内存限制:65535 KB 难度:5 描述 Michael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长底滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。下面是一个例子 1 2 3 4 5 16原创 2014-08-17 15:53:07 · 684 阅读 · 0 评论 -
单调递增最长子序列
时间限制:3000 ms | 内存限制:65535 KB 难度:4 描述 求一个字符串的最长递增子序列的长度 如:dabdbf最长递增子序列就是abdf,长度为4 输入 第一行一个整数0 随后的n行,每行有一个字符串,该字符串的长度不会超过10000 输出 输出字符串的最长递增子序列的长度 样例输入 3 aaa ababc abklmncdefg 样例输出 1 3原创 2014-08-18 15:52:16 · 456 阅读 · 0 评论 -
The Triangle
描述 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5 (Figure 1) Figure 1 shows a number triangle. Write a program that calculates the highest sum of numbers passed on a route that starts at the top and ends somewh原创 2014-08-23 15:39:37 · 481 阅读 · 0 评论