摘要：//264K 32MS#include<stdio.h>#include<string.h>#include<stdlib.h>#include<math.h>#include<algorithm>#include<stack>using namespace std;stack<int>S;struct node{ int id; node *next;}head[110];int n;int ranse;int index;int color[110];//每个节点的颜色bool visit[110];boo 阅读全文

摘要：//1824K 250MS#include<stdio.h>#include<string.h>#include<stdlib.h>#include<math.h>#include<algorithm>#include<stack>using namespace std;stack<int>S;int n,m;int num[10005];int ranse;struct node{ node *next; int id;}head[10005];//数组下标代表id,每条链表代表该点能到达的所有点int re 阅读全文