摘要：
http://acm.hdu.edu.cn/showproblem.php?pid=1269思路:Tarjan算法,模版题 1 #include <iostream> 2 #include <vector> 3 #include <stack> 4 using namespace std; 5 const int MAX = 10000 + 10; 6 int n; 7 vector <int> v[MAX]; 8 stack <int> s; 9 int mark_stack[MAX];10 int dfn[MAX];11 int 阅读全文
