摘要：
平面图转对偶图暴力枚举保护那些点然后求最小割即可#include#include#include#include#includeusing namespace std;#define maxn 4000#define maxp 12#define ll long long#define inf 0x3fffffffstruct P{ int a,b; }a1[maxn],p1[12];int n,m,p;int nn=1;int e[maxn],ne[maxn],v[maxn],w[maxn];int ver[maxn],he[maxn],nex[maxn],u[maxn];void add. 阅读全文
