状压dp
文章平均质量分 85
UMR小豪
这个作者很懒,什么都没留下…
展开
-
Problem Arrangement ZOJ - 3777
The 11th Zhejiang Provincial Collegiate Programming Contest is coming! As a problem setter, Edward is going to arrange the order of the problems. As we know, the arrangement will have a great effect o原创 2017-01-16 12:13:24 · 340 阅读 · 0 评论 -
Doing Homework (状压dp)
Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands in the homework after th原创 2017-06-06 21:15:31 · 650 阅读 · 0 评论 -
hdu1565 方格取数(1)(状压dp)
可以状压搞,因为n很小,虽说复杂度到了4亿,但是数据确实水。 #include using namespace std; const int MAXN = 20+5; int n; int tu[MAXN][MAXN]; int dp[2][1<<20]; void get_dp() { //记录两行的状态,每次枚举每一行的格点 for(int i = 0; i < n; +原创 2017-08-02 21:30:43 · 295 阅读 · 0 评论 -
poj2411 Mondriaan's Dream(状压dp)
Squares and rectangles fascinated the famous Dutch painter Piet Mondriaan. One night, after producing the drawings in his 'toilet series' (where he had to use his toilet paper to draw on, for all of h原创 2017-08-02 23:38:53 · 291 阅读 · 0 评论 -
HDU 4085 斯坦纳树
近期更新可能会比较少,只会更新新的知识点,因为要尽快多刷一些题。。。。 详解请参照:详解 然后按照思路,自己搞的份模版。#include <bits/stdc++.h> using namespace std;const int MAXN = 50+7; const int inf = 1e8; typedef long long LL; struct node { int v,w;原创 2017-10-22 23:38:21 · 321 阅读 · 0 评论