题目:P1726 上白泽慧音
学习了强联通分量(scc),找了个裸题,用tarjan算法AC了,Dalao勿喷啊! -_-||
# include <iostream>
# include <cstring>
# include <vector>
# include <stack>
using namespace std;
int n, m, scctot, scc[5010], low[5010], dfn[5010], dfntot, maxn, num;
vector<int> map[5010];
stack<int> s;
void tarjan(int u) {
low[u] = dfn[u] = ++dfntot; // 访问步数,后面会不断更新low
// low就是u或u的子树能够追溯到的最早的栈中节点的次序号
s.push(u); // u结点入栈,后面用来找一个强连通分量
for(int i = 0; i < map[u].size(); i++) {
int v = map[u][i];
if(dfn[v] == 0) { // 当v没有访问过时,再tarjan(v),更新low
tarjan(v);
low[u] = min(low[u], low[v]);
} else if(scc[v] == 0) low[u] = min(low[u], dfn[v]);
//当v不在某个强连通分量时,再更新low
}