POJ 3683 Priest John's Busiest Day
摘要:
2-SAT经典问题#include<cstdio>
#include<string.h>
#include<math.h>
#include<stack>
#define N 2010
#define M N*N*3
using namespace std;
struct edge{ int v,next;
}edge[M];
int n;
int s[N],t[N],seq[N];
int cnt,head1[N],head2[N],head3[N];
int scc,index,dfn[N],low[N],belong[N];
int top 阅读全文
posted @ 2012-02-17 22:06 c语言源码 阅读(191) 评论(0) 推荐(0) 编辑