![](https://img-blog.csdnimg.cn/20201014180756923.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
动态规划
文章平均质量分 87
ForeseeMark
一只非洲程序猿渣渣
展开
-
POJ 1179 Polygon(区间DP)
题目链接:http://poj.org/problem?id=1179DescriptionPolygon is a game for one player that starts on a polygon with N vertices, like the one in Figure 1, where N=4. Each vertex is labelled with an integer and原创 2017-02-19 20:55:03 · 483 阅读 · 0 评论 -
POJ 2342 Anniversary party(树形DP)
题目链接:http://poj.org/problem?id=2342 Time Limit: 1000MS Memory Limit: 65536KDescriptionThere is going to be a party to celebrate the 80-th Anniversary of the Ural State University. The University原创 2017-02-28 21:59:47 · 244 阅读 · 0 评论 -
POJ 2479 Maximum sum(动态规划、多段最大子序列求和)
题目链接:http://poj.org/problem?id=2479DescriptionGiven a set of n integers: A={a1, a2,…, an}, we define a function d(A) as below: d(A)=max1≤s1≤t1<s2≤t2≤n{∑i=s1t1ai+∑j=s2t2aj}d(A)=\max_{1\leq s1\leq t1<s2原创 2017-01-23 14:43:05 · 1077 阅读 · 0 评论 -
LeetCode 5 Longest Palindromic Substring(最长回文子串,暴力剪枝/DP/曼彻斯特算法)
Longest Palindromic Substring题目链接:Longest Palindromic SubstringDescriptionGiven a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.Example: I原创 2017-03-29 13:12:41 · 631 阅读 · 0 评论