欧拉回路
Change_ZHONG
成在坚持
展开
-
tjut 3018
#include using namespace std; const int M = 100000 + 10; int gree[M]; int father[M]; int rank1[M]; int save[M]; bool used[M]; bool mark[M]; void Make_Set(int x) { father[x] = x; rank1[x] =原创 2016-08-16 09:27:39 · 128 阅读 · 0 评论 -
tjut 2894
#include #include #include using namespace std; int p,d[1<<15],n; bool vis[1<<15]; void prev() { memset(vis,0,sizeof vis); p=0; } void dfs(int u) { int to1=(u<<1)&((1<<n)-1); int to原创 2016-08-13 22:57:51 · 145 阅读 · 0 评论 -
tjut 1878
#include #include #include #include #include #include #include #include #include #include #define INF 99999999 using namespace std; const int MAX=1001; int n,m,father[MAX],rank1[MAX]; int degree[MAX]原创 2016-08-13 23:14:43 · 139 阅读 · 0 评论 -
tjut 5883
#include using namespace std; const int maxn = 1e5+7; int a[maxn]; int degree[maxn]; int main() { int T; scanf("%d",&T); while(T--) { memset(degree,0,size原创 2016-09-18 11:33:26 · 162 阅读 · 0 评论