DP
文章平均质量分 83
成诚tbf
这个作者很懒,什么都没留下…
展开
-
HDU4003_Find_Metal_Mineral_树形DP分组
额- -其实也是看的别人的题解才做出来的,不过自己完完整整的写了一遍加详尽注释,感觉理解的透彻了些,又给同级的同学们讲了一遍,总之收获还是蛮大的。写的代码是交的一道DIY的改编题,里面数据被肖神变态加强了,但是时间还是跟原题一样(T_T)导致我用Vector建树被卡时间了,后来开2000ms的试了一下1078ms- -瞬间无语,只能说肖神编的数据太恰到好处了,所以当时没办法就照着模版写了用结构原创 2013-07-10 09:43:56 · 554 阅读 · 0 评论 -
HDU 2224 The shortest path_TSP旅行商问题_DP
原题:The shortest pathTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 654 Accepted Submission(s): 335Problem DescriptionT原创 2014-02-20 10:30:34 · 754 阅读 · 0 评论 -
POJ 1947 Rebuilding Roads 树形DP(背包)
原题:Rebuilding RoadsTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 8567 Accepted: 3836DescriptionThe cows have reconstructed Farmer John's f原创 2014-02-20 09:35:00 · 537 阅读 · 0 评论 -
HDU 4568 Hunter TSP_DP
原题:HunterTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 958 Accepted Submission(s): 269Problem Description One day, a原创 2014-02-20 11:03:19 · 607 阅读 · 0 评论 -
HDU 2602 Bone collector 01背包
裸的01背包,不解释Bone CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 21261 Accepted Submission(s): 8530Problem Description原创 2013-07-30 09:45:56 · 586 阅读 · 0 评论 -
HDU 2167 Pebbles_状压求点集的最大权值和
原题:PebblesTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 837 Accepted Submission(s): 465Problem DescriptionYou're give原创 2014-02-20 16:03:14 · 615 阅读 · 0 评论 -
HDU 4778 Gems Fight!_状压
原题:Gems Fight!Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 327680/327680 K (Java/Others)Total Submission(s): 743 Accepted Submission(s): 314Problem Description A原创 2014-02-20 15:45:50 · 981 阅读 · 0 评论 -
ZOJ 3734 LIKE vs CANDLE _树形DP
原题:LIKE vs CANDLETime Limit: 2 Seconds Memory Limit: 65536 KBA microblog caused a war recently - There's the war between LIKE and CANDLE.As you see, there are N accounts are try原创 2014-02-19 16:42:48 · 673 阅读 · 0 评论 -
HDU 1054 Strategic Game
原题:Strategic GameTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4400 Accepted Submission(s): 1955Problem Description原创 2014-02-19 15:46:32 · 474 阅读 · 0 评论 -
HDU2412 & POJ3342 Party at Hali-Bula_树形DP
原题:Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionDear Contestant, I'm going to have a party at my villa at Hali-Bula to原创 2014-02-19 15:31:18 · 678 阅读 · 0 评论 -
HDU 3593 The most powerful force 树形DP(背包)
原题:The most powerful forceTime Limit: 16000/8000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 938 Accepted Submission(s): 238Problem Descripti原创 2014-02-19 17:07:44 · 769 阅读 · 1 评论 -
FZU 2109 Mountain Number_数位DP
原题:Problem DescriptionOne integer number x is called "Mountain Number" if:(1) x>0 and x is an integer;(2) Assume x=a[0]a[1]...a[len-2]a[len-1](0≤a[i]≤9, a[0] is positive). Any a[2i+1] is l原创 2014-02-22 11:11:32 · 607 阅读 · 0 评论 -
HDU 1257 最少拦截系统 贪心
最少拦截系统Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12629 Accepted Submission(s): 5006Problem Description某国为了防御敌国的导弹袭击,发展出一种导弹拦原创 2013-07-30 09:37:59 · 627 阅读 · 0 评论 -
UVA11324_The Largest Clique_tarjan求强连通分量+DP求最长路
题意:给一个图,求它的一个最大子图,使得图中任意两点之间都至少有一条路径【注意是两点之间有路径,而不是可以到达任意一点,所以不是强连通分量】【PS:题中给的传递闭包其实是个迷惑,没有用,因为在原图上做,和在传递闭包的图上做是完全一样的】题解:先求出图中的所有强连通分量,将每个分量缩为一点使之成为一个DAG图,这样在这个无环图中,找子图使得满足条件关键:把问题“使得子原创 2013-07-21 22:19:27 · 738 阅读 · 0 评论 -
POJ1050_To the Max_求最大子矩阵_DP
/*吐槽:唔。。。从早上就开始看这个题了- -又荒废了一天。早上睡觉到十点半,然后就开了个会到12点,回来睡觉到4点多起来看B站,看楼教主的回忆录,跟看小说似的到晚上才开始编又是自己想了想觉得暴力不行就去搜代码了- -不解释了*/题意:求一个N*N的矩阵的最大子矩阵思路:把二维压缩成一维,转化为求一维数组的最大子序列(表示连一维的也木原创 2013-07-11 20:30:45 · 600 阅读 · 0 评论