![](https://img-blog.csdnimg.cn/20201014180756918.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
动态规划
乐清sss
立志成为大师的萌妹子!
展开
-
POJ 1163: The Triangle(dp)
【原题】 Write a program that calculates the highest sum of numbers passed on a route that starts at the top and ends somewhere on the base. Each step can go either diagonally down to the left or diagona原创 2017-08-03 15:17:14 · 216 阅读 · 0 评论 -
POJ 2533: Longest Ordered Subsequence
【Problem Description】 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原创 2017-08-03 14:22:33 · 229 阅读 · 0 评论