POJ-DP
文章平均质量分 76
RTD
这个作者很懒,什么都没留下…
展开
-
POJ-1458-Common Subsequence-经典DP
题目来源:http://poj.org/problem?id=1458 Common Subsequence Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 55804 Accepted: 23228 DescriptionA subsequence of a given sequence is t原创 2017-11-19 11:54:28 · 120 阅读 · 0 评论 -
POJ-1742-Coins-DP-男人八题
题目来源:http://poj.org/problem?id=1742 题目内容:Coins Time Limit: 3000MS Memory Limit: 30000K Total Submissions: 39405 Accepted: 13359 DescriptionPeople in Silverland use coins.They have coins原创 2017-11-20 18:13:37 · 178 阅读 · 0 评论 -
刷子表
列表一:经典题目题号: 容易: 1018, 1050, 1083, 1088, 1125, 1143, 1157, 1163, 1178, 1179, 1189, 1191,1208, 1276, 1322, 1414, 1456, 1458, 1609, 1644, 1664, 1690, 1699, 1740, 1742, 1887, 1926, 1936, 1952, 1953,转载 2017-11-15 18:38:18 · 229 阅读 · 0 评论 -
POJ-2456-Aggressive cows
题目来源:http://poj.org/problem?id=1952 题目内容:BUY LOW, BUY LOWER Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 10554 Accepted: 3698 DescriptionThe advice to “buy low” is half th原创 2017-11-21 15:24:03 · 122 阅读 · 0 评论 -
POJ-1050-To the Max-二维最大子序列和
题目来源:http://poj.org/problem?id=1050 题目内容:To the Max Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 50099 Accepted: 26544 DescriptionGiven a two-dimensional array of positive原创 2017-11-21 20:55:17 · 241 阅读 · 0 评论 -
POJ-1157-LITTLE SHOP OF FLOWERS
题目来源:http://poj.org/problem?id=1157 题目内容:LITTLE SHOP OF FLOWERS Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 21994 Accepted: 10166 DescriptionYou want to arrange the windo原创 2017-11-21 23:02:15 · 120 阅读 · 0 评论 -
POJ-1088-滑雪
题目来源:http://poj.org/problem?id=1088 题目内容:滑雪 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 101638 Accepted: 38670 DescriptionMichael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,原创 2017-11-21 21:59:33 · 404 阅读 · 0 评论