状压DP
关注
分享
扫一扫
Just_JK
这个作者很懒，什么都没留下…
展开
-
HDU 5691 Sitting in Line (TSP状压)
Sitting in LineTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1351 Accepted Submission(s): 643Problem Description度度熊是他同时代中最伟大的数学家，一切数字都要听...原创 2018-01-27 16:14:40 · 161 阅读 · 0 评论 -
HDU 3182 Hamburger Magi(状压DP)
Hamburger Magi Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1109 Accepted Submission(s): 414 Problem Description In the mysteriou原创 2018-01-27 11:25:18 · 233 阅读 · 0 评论 -
HDU 5555 Immortality of Frog(状压DP)
Immortality of Frog Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 373 Accepted Submission(s): 131 Problem Description N frogs ...原创 2018-01-29 21:28:15 · 351 阅读 · 0 评论 -
HDU 6321 Problem C. Dynamic Graph Matching(状压dp)
题目链接 Problem C. Dynamic Graph Matching Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others) Total Submission(s): 984 Accepted Submission(s): 393 Problem Descript...原创 2018-07-31 15:32:32 · 228 阅读 · 0 评论 -
ACM-ICPC 2018 南京赛区网络预赛 E. AC Challenge (状压dp)
题目链接 题意: 给你n(1<=n<=20)个题目，在第t秒完成该题可以获得t*a[i]+b[i]价值(|a[i],b[i]|<=1e9) 并且某些题目有前提，需要先完成其他题目，才能做该题 然后你每一秒都需要做一题(有且只能完成一题)，做题的时间忽略，一旦某一秒你没有完成题目，那么就宣布你停止了。 问你最大能获得的价值是多少 解析： 本来想开两维的dp,来状...原创 2018-09-02 16:50:14 · 212 阅读 · 0 评论 -
HDU 5711 Ingress(状压dp+优先队列)
Ingress Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 102400/65535 K (Java/Others) Total Submission(s): 474 Accepted Submission(s): 229 Problem Description Brickgao, who profited fro...原创 2018-10-29 21:26:02 · 305 阅读 · 0 评论