摘要： poj 2186 Popular Cows强连通分量 tarjanhttp://poj.org/problem?id=2186#include <iostream>#include "stdio.h"#include "string.h"using namespace std;struct node{ int v, next;}edge[50000];const int MAXV = 10001;int adj[MAXV], lp, low[MAXV], dfn[MAXV], out[MAXV], belong[MAXV], stack[MA 阅读全文