摘要：1 #include 2 #include 3 #define MAX_V 10050 4 5 int V,E; //V表示顶点数，E表示边数（顶点标号为0~V-1) 6 vector G[MAX_V]; //图的邻接表表示 7 vector rG[MAX_V]; //把边反向后的图 8 vector vs; //后序遍历顺序的顶点列表（即用一个栈模拟了回溯时的标号） 9 bool used[MAX_V]; //DFS中用到的访问标记10 int cmp[MAX_V]; //顶点所属强连... 阅读全文

摘要：Popular CowsTime Limit:2000MSMemory Limit:65536KTotal Submissions:21685Accepted:8852DescriptionEvery cow's dream is to become the most popular cow in the herd. In a herd of N (1 2 #include 3 #include 4 #include 5 #define MAX_V 10050 6 7 using namespace std; 8 9 int V,E; 10 vector G[MAX_V]... 阅读全文