动态规划
_好吗_好的
Stay Hungry,Stay Foolish.
展开
-
动态规划-记忆化搜索
刘汝佳第九章–动态规划–数学三角形问题 题目大意:有一个由非负整数组成的三角形,第一行只有一个数,除了最下行之外每个数的的左下方和右下方各有一个数。从第一行的数开始,每次可以往左下或右下走一格,直到走到最下行,把沿途经过的数全部加起来,如何走才能使这个数最大? 1 3 2 4 10 1 4 3 2 20#include <cstdio> #inc原创 2017-08-02 12:01:45 · 286 阅读 · 0 评论 -
POJ - 2533 -Longest Ordered Subsequence(LIS模板题)
A numeric sequence of ai is ordered if a1 Your program, when given the numeric sequence, must find the length of its longest ordered subsequence. Input The first line of input file contains the le原创 2018-02-01 15:50:46 · 248 阅读 · 0 评论 -
POJ - 1631-Bridging signals (LIS二分模板题)
‘Oh no, they’ve done it again’, cries the chief designer at the Waferland chip factory. Once more the routing designers have screwed up completely, making the signals on the chip connecting the ports原创 2018-02-01 20:12:17 · 215 阅读 · 0 评论 -
POJ - 3903-Stock Exchange(LIS二分模板题)
The world financial crisis is quite a subject. Some people are more relaxed while others are quite anxious. John is one of them. He is very concerned about the evolution of the stock exchange. He foll原创 2018-02-01 20:14:34 · 534 阅读 · 0 评论