codeforces 687A NP-Hard Problem(DFS二分图判定)
题目链接:http://codeforces.com/problemset/problem/687/A#includeusing namespace std;const int N=1e5+5;vector a[N];int n,m,flag=1,num1=0,num2=0;int vis[N];void dfs(int i,int mark){ if(vis[i
原创
2016-09-03 13:08:46 ·
389 阅读 ·
0 评论