改天把2-sat刷完了再一起总结吧，先放这儿#include<stdio.h>#include<string.h>#include<vector>#include<algorithm>using namespace std;const int MAX =20010;vector<int> edge[MAX];int st[MAX];int dfn[MAX],low[MAX];int top,btype,tdfn;int belong[MAX];bool ins[MAX];void dfs(int s){ int i,t; dfn[s] Read More