随笔分类 -  ACM-DP状态压缩

摘要:Fluorescent Time Limit: 3000/3000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 937 Accepted Submission(s): 477 Pro 阅读全文
posted @ 2018-09-26 22:44 StarHai 阅读(430) 评论(0) 推荐(0)
摘要:There are NN different kinds of transport ships on the port. The i^{th}ith kind of ship can carry the weight of V[i]V[i] and the number of the i^{th}i 阅读全文
posted @ 2018-09-15 19:56 StarHai 阅读(566) 评论(0) 推荐(0)
摘要:链接:http://codeforces.com/contest/401/problem/D 题意:给出一个数字num和m,问通过重新排列num中的各位数字中有多少个数(mod m)=0,直接枚举全排列肯定不行,可以用状压dp来搞.. dp[S][k]表示选了num中的S且(mod m)=k的方案种 阅读全文
posted @ 2018-07-29 20:21 StarHai 阅读(215) 评论(0) 推荐(0)
摘要:Corn FieldsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 16473 Accepted: 8678DescriptionFarmer John has purchased a lush n... 阅读全文
posted @ 2018-06-18 21:07 StarHai 阅读(151) 评论(0) 推荐(0)