动态规划
文章平均质量分 79
A_Happyer
这个作者很懒,什么都没留下…
展开
-
uva567 Risk(floyd)
Risk Risk is a board game in which several opposing players attempt to conquer the world. The gameboard consists of a world map broken up into hypothetical countries. During a play原创 2014-05-10 12:57:02 · 682 阅读 · 0 评论 -
hdu 1712 ACboy needs your help (分组背包)
Problem H Time Limit : 1000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other) Total Submission(s) : 7 Accepted Submission(s) : 4 Problem Description ACboy has N courses this原创 2014-05-15 16:24:40 · 481 阅读 · 0 评论 -
pOJ1276 Cash Machine(背包)
Problem E Time Limit : 2000/1000ms (Java/Other) Memory Limit : 20000/10000K (Java/Other) Total Submission(s) : 22 Accepted Submission(s) : 14 Problem Description A Bank plans to instal原创 2014-05-16 00:07:20 · 530 阅读 · 0 评论 -
hdu 2191-wust9(多重背包典型)
Problem D Time Limit : 1000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other) Total Submission(s) : 10 Accepted Submission(s) : 7 Font: Times New Roman | Verdana | Georgia F原创 2014-04-26 11:49:13 · 580 阅读 · 0 评论 -
HDU-1059-Dividing-wust9(背包)
Problem E Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 21 Accepted Submission(s) : 6 Font: Times New Roman | Verdana | Georgia F原创 2014-04-26 15:28:04 · 553 阅读 · 0 评论 -
HDU2159:FATE(二维完全背包)
FATE Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6996 Accepted Submission(s): 3221 Problem Description 最近xhd正在玩一款叫做FATE的游戏,为原创 2014-05-07 15:36:43 · 640 阅读 · 0 评论 -
hdu 2639 Bone Collector II(0-1背包第k优解)
Problem B Time Limit : 5000/2000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other) Total Submission(s) : 11 Accepted Submission(s) : 7 Problem Description The title of this probl原创 2014-05-15 23:02:49 · 554 阅读 · 0 评论 -
HDU 1080 Human Gene Functions (DP,最长公共子序列)
Problem A Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 7 Accepted Submission(s) : 4 Problem Description It is well known that a原创 2014-05-23 17:18:44 · 479 阅读 · 0 评论 -
HDU 1505:City Game(悬线DP)
F - Problem F Time Limit:3000MS Memory Limit:30000KB 64bit IO Format:%I64d & %I64u Submit Status Description Bob is a strategy game programming specialist. In his new city bu原创 2014-07-30 09:21:41 · 570 阅读 · 0 评论 -
HDU 2089 不要62(数位 dp)
http://acm.hdu.edu.cn/showproblem.php?pid=2089原创 2014-09-10 23:16:35 · 537 阅读 · 0 评论 -
acm模板(背包)
const int MAXV=100004; inline void pack(int f[],int V,int v,int n,int w) { if(n==0||v==0)return ; if(n==1) { for(int i=V;i>=v;i--) if(f[i]<f[i-v]+w)f[i]=f[i-v]+w; return; } if(n*v>=V-v+1)原创 2014-05-13 12:39:07 · 590 阅读 · 0 评论 -
HDU2955 Robberies(特殊思路,概率背包)
Robberies Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 10405 Accepted Submission(s): 3827 Problem Description The aspiring Ro原创 2014-05-07 23:51:47 · 751 阅读 · 0 评论 -
POJ 1458 Common Subsequence (动规,最长公共子序列)
Problem A Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 33 Accepted Submission(s) : 18 Problem Description A subsequence of a giv原创 2014-05-20 16:07:57 · 726 阅读 · 0 评论 -
HDU2571:命运(DP)
Problem I Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other) Total Submission(s) : 48 Accepted Submission(s) : 25 Problem Description 穿过幽谷意味着离大魔王lemon已经无限接近原创 2014-05-23 19:02:17 · 417 阅读 · 0 评论 -
hdu 1503:Advanced Fruits(动态规划+路径输出)
I - Advanced FruitsTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionThe company "21st Century Fruits" has specialized in creating new sorts of fruits by tran原创 2014-07-05 19:15:57 · 649 阅读 · 0 评论 -
POJ 3267-The Cow Lexicon (动态规划)
J - The Cow Lexicon Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Description Few know that the cows have their own dictionary with W (1原创 2014-07-10 10:15:00 · 523 阅读 · 0 评论 -
HDU2063:Investment-wust9(完全背包典型)
Problem C Time Limit : 5000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 36 Accepted Submission(s) : 8 Font: Times New Roman | Verdana | Georgia F原创 2014-04-26 13:39:06 · 821 阅读 · 0 评论 -
HDOJ1203 I NEED A OFFER! --wust9 (概率背包)
Problem F Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 15 Accepted Submission(s) : 12 Font: Times New Roman | Verdana | Georgia原创 2014-04-26 17:34:44 · 687 阅读 · 0 评论 -
HDU 1864:最大报销额-wust9(背包,数据放大)
Problem H Time Limit : 1000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other) Total Submission(s) : 15 Accepted Submission(s) : 7 Font: Times New Roman | Verdana | Georgia F原创 2014-04-27 10:15:09 · 831 阅读 · 0 评论 -
HDU1231 最大连续子序列(动态规划)
最大连续子序列 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 17753 Accepted Submission(s): 7863 Problem Description 给定K个整数的序列{ N1, N2原创 2014-05-08 23:06:04 · 752 阅读 · 0 评论 -
HDU 1176 免费馅饼(dp)
Problem G Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 35 Accepted Submission(s) : 13 Problem Description 都说天上不会掉馅饼,但有一天gameboy正原创 2014-05-23 17:22:17 · 424 阅读 · 0 评论 -
poj 5001 Walk &&2014 ACM/ICPC Asia Regional Anshan Online 1005(dp)
http://acm.hdu.edu.cn/showproblem.php?pid=5001 思路:dp计算出途径每个点的总概率,1-x即为所求解。 dp题,先介绍下dp[i][j]为第j步走在第i个点的概率,那么dp[i][j]=dp[x1][j-1]+dp[x2][j-1]+...,x1,x2为i 的相邻节点。上一步在相邻节点这一步才能走到该点嘛。 每个点概率要一个一个的算,当算到第ii原创 2014-09-13 21:13:59 · 1239 阅读 · 0 评论