动态规划
MiniSheep_CS
编程者如上帝,可以创造万物。
展开
-
hdu3665 seaside(floyd算法)
SeasideTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1130 Accepted Submission(s): 825Problem DescriptionXiaoY is living in原创 2014-11-08 11:10:45 · 475 阅读 · 0 评论 -
hdu1080 Human Gene Functions (DP动态规划,带权最长公共子串)
Human Gene FunctionsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2733 Accepted Submission(s): 1545Problem DescriptionIt is原创 2015-08-24 22:17:17 · 450 阅读 · 0 评论 -
HDU1069 Monkey and Banana(dp动态规划,最长非递减子序列变形题)
Monkey and BananaTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9861 Accepted Submission(s): 5126Problem DescriptionA group原创 2015-08-24 13:16:10 · 837 阅读 · 0 评论 -
hdu1081 最大子矩阵和(DP动态规划 最大子序列和变形题)
To The MaxTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9922 Accepted Submission(s): 4791Problem DescriptionGiven a two-dim原创 2015-08-25 13:17:14 · 552 阅读 · 0 评论 -
POJ2533(Longest Ordered Subsequence 最长公共子序列 DP或单调队列+二分)
Longest Ordered SubsequenceTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 34454 Accepted: 15135DescriptionA numeric sequence of ai is ordered ifa1 a2 a原创 2014-11-16 20:20:15 · 2891 阅读 · 1 评论 -
POJ1157 LITTLE SHOP OF FLOWERS(动态规划DP)
LITTLE SHOP OF FLOWERSTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 19011 Accepted: 8791DescriptionYou want to arrange the window of your flower shop原创 2015-04-28 12:09:28 · 924 阅读 · 0 评论 -
POJ2342 Anniversary party(树形DP)
Anniversary partyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4850 Accepted: 2751DescriptionThere is going to be a party to celebrate the 80-th Anniv原创 2015-04-27 18:50:21 · 375 阅读 · 0 评论 -
POJ1463 Strategic game(树形DP)
Strategic gameTime Limit: 2000MS Memory Limit: 10000KTotal Submissions: 6722 Accepted: 3095DescriptionBob enjoys playing computer games, especially strategic game原创 2015-04-27 20:20:51 · 1424 阅读 · 1 评论 -
poj1159(滚动数组 + DP)
PalindromeTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 55248 Accepted: 19105DescriptionA palindrome is a symmetrical string, that is, a string read原创 2015-05-20 12:45:24 · 427 阅读 · 0 评论 -
POJ1837 Balance(动态规划)
BalanceTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 11431 Accepted: 7127DescriptionGigel has a strange "balance" and he wants to poise it. Actually,原创 2015-04-13 19:58:09 · 332 阅读 · 0 评论 -
POJ1276 Cash Machine(动态规划)
Cash MachineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 28982 Accepted: 10375DescriptionA Bank plans to install a machine for cash withdrawal. The m原创 2015-04-13 19:51:13 · 428 阅读 · 0 评论 -
算法导论(LCS最长公共子序列)
真动态规划版(自底而下):#includeusing namespace std;const int maxn = 10001;int m,n;char b[maxn][maxn]; //回溯时保存路径int c[maxn][maxn]; //最长子序列void LCS(char *x,char *y){ int i,j; for(i=0;i<=m;i++)原创 2015-04-13 09:40:42 · 408 阅读 · 0 评论 -
hdu1864(最大报销额 DP动态规划)
最大报销额Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16926 Accepted Submission(s): 4929Problem Description现有一笔经费可以报销一定额度的发票。允许报销的原创 2014-11-17 09:55:41 · 4687 阅读 · 9 评论 -
HDU1024 Max Sum Plus Plus(DP动态规划 最大子串和增强版)
Max Sum Plus PlusTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20708 Accepted Submission(s): 6886Problem DescriptionNow I t原创 2015-08-23 21:12:43 · 1100 阅读 · 0 评论