ZOJ 3795 — Grouping 缩点+拓扑

原题：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3795

题意：给定n个点，m条有向边；

            问至少把点分成几个集合，使得集合中任意两点均不可到达（一个集合存放一个点也可以）；

思路：首先把环缩点，新得到的点权值为环中点数和，然后拓扑求最长链；

#include<stdio.h>
#include<string.h>
#include<queue>
#include<vector>
#include<iostream>
#include<algorithm>

using namespace std;
const int N = 100005;
int n, m, edgenum;
int top, Time, taj;
bool vis[N];
int DFN[N], head[N], low[N], belong[N], stack[N];

struct node
{
	int from, to, nex;
	bool sign;
}edge[300005];

void add(int u, int v)
{
	edge[edgenum].from = u;
	edge[edgenum].to = v;
	edge[edgenum].sign = false;
	edge[edgenum].nex = head[u];
	head[u] = edgenum++;
}

vector<int>bcc[N];
void tarjan(int u, int fa)
{
	DFN[u] = low[u] = Time++;
	vis[u] = 1;
	stack[top++] = u;
	for(int i = head[u];i!=-1;i = edge[i].nex)
	{
		int v = edge[i].to;
		if(DFN[v] == -1)
		{
			tarjan(v, u);
			low[u] = min(low[u], low[v]);
			if(DFN[u] < low[v])
				edge[i].sign = 1;
		}
		else if(vis[v])
		low[u] = min(low[u], DFN[v]); 		
	}
	if(low[u] == DFN[u])
	{  
		taj++; 
		bcc[taj].clear();
		while(1)
		{
			int now = stack[--top];  
			vis[now] = 0; 
			belong[now] = taj;
			bcc[taj].push_back(now);
			if(now == u)
			break;
		}
	}
}

vector<int>G[N];
int du[N];
void suodian()
{
	for(int i = 1;i<=taj;i++)
	{
		G[i].clear();
		du[i] = 0;
	}
	for(int i = 0;i<edgenum;i++)
	{
		int u = belong[edge[i].from];
		int v = belong[edge[i].to];
		if(u!=v)
		{
			G[u].push_back(v);
			du[v]++;
		}
	}
}

int dis[N];
int bfs()
{
	memset(dis, 0, sizeof(dis));
	queue<int>q;
	for(int i = 1;i<=taj;i++)
	{
		if(du[i] == 0)
		{
			q.push(i);
			dis[i] = bcc[i].size();
		}
	}	
	while(!q.empty())
	{
		int u = q.front();
		q.pop();
		for(int i = 0;i<G[u].size();i++)
		{
			int v = G[u][i];
			dis[v] = max(dis[u]+(int)bcc[v].size(), dis[v]);
			du[v]--;
			if(du[v] == 0)
			q.push(v);
		}
	}
	int ans = 1;
	for(int i = 1;i<=taj;i++)
		ans = max(ans, dis[i]);
	return ans;
}

void tarjan_init(int all)
{
	memset(DFN, -1, sizeof(DFN));
	memset(vis, false, sizeof(vis));
	top = Time = taj = 0;
	for(int i = 1;i<=all;i++)
	{
		if(DFN[i] == -1)
		tarjan(i, i);
	}
}

int main()
{
	while(scanf("%d%d", &n, &m)!=EOF)
	{
		memset(head, -1, sizeof(head));
		edgenum = 0;
		for(int i = 1;i<=m;i++)
		{
			int u, v;
			scanf("%d%d", &u, &v);
			add(u, v);
		}
		tarjan_init(n);
		suodian();
		printf("%d\n", bfs());
	}
	return 0;
}