摘要:
http://codeforces.com/problemset/problem/580/D 状态压缩DP。#includeconst int maxn=18;using namespace std;typedef long long int64;typedef pair PII;int64 f[... 阅读全文
摘要:
http://codeforces.com/problemset/problem/573/C 给一颗树,问是否能画在两行平行的点格图上(无限长),边长随意,不能相交。#includeconst int maxn=1e5+15;using namespace std;vector g[maxn];i... 阅读全文