forezxl的博客

状压DP

BZOJ1688 疾病管理Description Alas! A set of D (1 <= D <= 15) diseases (numbered 1..D) is running through the farm. Farmer John would like to milk as many of his N (1 <= N <= 1,000) cows as possible. If th

状压DP

状压DP题目传送门为什么我会觉得prim是对的！为什么我70分的暴力都不打！果然我好菜我是不会告诉你我不知道怎么枚子集的n=12就是状压的范围。据说标算O(4n)​O(4n)​O(4^n)​我不会啊，优化过的O(n3n)​O(n3n)​O(n3^n)​我也不会啊，我只会O(n23n)​O(n23n)​O(n^23^n)​啊不管了能过就行！Orz写模拟退火的f[i][j][s...

最短路 状压BZOJ题目传送门洛谷题目传送门设f[i][s]f[i][s]f[i][s]为到点iii能杀的怪的状态为sss的最短路。用Dij刷分层图最短路的时候转移就好了。代码：#include&lt;queue&gt;#include&lt;cctype&gt;#include&lt;cstdio&gt;#include&lt;cstring&gt;#include&lt;al...