VSEJGFB的博客

题目描述 传送门简单的状态压缩DP。代码#include<cstdio> #include<iostream> #include<algorithm> #include<cstring> using namespace std; const int maxn=18; int d[1<<maxn],p[maxn],S1[1<<maxn]; int main(){ int n,kase=0;