![](https://img-blog.csdnimg.cn/20201014180756922.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM-动态规划
黄金四叶草
Accepted
展开
-
HDU 1052田忌赛马 贪心+动态数组
http://acm.hdu.edu.cn/showproblem.php?pid=1052 就是田忌赛马,贪心策略为: 田忌的最快与齐王最快比,田忌快则比掉,赢下; 田忌慢则用田忌最慢的比齐王最快,输掉; 快马相等的话,用田忌的最慢与齐王最慢比,田忌快则赢下,田忌慢则比齐王最快输掉; 最快与最慢都相等,则用田忌最慢比掉齐王最快,输掉; #include #include #inc原创 2016-05-15 19:07:53 · 335 阅读 · 0 评论 -
HDU 4521 小明系列问题——小明序列 LIS+动态规划
HDU 4521小明系列问题——小明序列 Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticeHDU 4521 Description 大家都知道小明最喜欢研究跟序列有关的问题了,可是也就因为这样,小明几乎已经玩遍各种序列原创 2016-08-01 10:02:36 · 540 阅读 · 0 评论 -
HDU 1003 区间最大和问题(动态规划)
Max Sum Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 183319 Accepted Submission(s): 42766 Problem Description Given a sequence a[1],a原创 2015-09-20 00:35:34 · 401 阅读 · 0 评论 -
POJ 3661 跑步+dp
Running Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6551 Accepted: 2440 Description The cows are trying to become better athletes, so Bessie is runni原创 2016-10-07 21:36:41 · 500 阅读 · 0 评论 -
POJ 2955 Brackets+区间dp
Brackets Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6621 Accepted: 3557 Description We give the following inductive definition of a “regular brackets”原创 2016-10-07 21:55:20 · 169 阅读 · 0 评论 -
POJ 1141 Brackets Sequence+区间DP+想办法输出来
Brackets Sequence Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 30729 Accepted: 8813 Special Judge Description Let us define a regular brackets sequenc原创 2016-10-07 22:21:35 · 274 阅读 · 0 评论 -
POJ 3280 Cheapest Palindrome区间dp
Cheapest Palindrome Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu Submit Status Practice POJ 3280 Description Keeping track of all the cows can be a tr原创 2016-10-08 09:02:12 · 280 阅读 · 0 评论