摘要：
#include #include #include #include #include using namespace std;const int maxn = 16100;struct node { int v,next;} edge[41000];int head[maxn],sta[maxn],vis[maxn];int id,top,n;void add_edge(int u,int v){ edge[id].v = v;edge[id].next = head[u];head[u] = id++;}int dfs(int u){ if( vis[u^1] )r... 阅读全文
