状压dp
lpls1
这个作者很懒,什么都没留下…
展开
-
hdu1074(状态压缩dp)
Doing HomeworkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7660 Accepted Submission(s): 3454Problem DescriptionIgnatius has just come ...原创 2019-10-22 20:34:19 · 144 阅读 · 0 评论 -
hdu5418
package algorithm;import java.util.Scanner;public class test { public static int T,n,m,w,u,v,G[][],dp[][],INF=(1<<30)-1; public static void floyd() { for(int k=1;k<=n;++k) { G[k][k...原创 2019-08-03 15:40:11 · 156 阅读 · 0 评论 -
poj2686
package algorithm;import java.util.Scanner;public class test { static int n,m,p,a,b,G[][],t[],x,y,z; static double dp[][],INF=Double.MAX_VALUE; public static double solve() { double ans=INF; ...原创 2019-08-05 22:00:52 · 156 阅读 · 0 评论 -
poj2411
package algorithm;import java.util.Arrays;import java.util.Scanner;public class test { public static int maxn = 11; public static int ans, dp[][] = new int[maxn + 1][(1 << maxn)], path[][...原创 2019-08-06 12:55:42 · 150 阅读 · 0 评论 -
状压dp套路总结
1.创建变量,状态转移数组dp,行内合法状态数组state,记录行内合法状态的某种属性的数组num,记录状态数量的count,原始行数组row,等2.写判断合法的函数。判断行内合法ok(int sta),判断两行之间合法fit(int sta1,int sta2),等3.写main函数:填充row(注意有时会把原图的01代码取反,以方便使用ok函数),填充state和num,初始化dp的起始值...原创 2019-09-02 13:46:34 · 227 阅读 · 0 评论