POJ 1236 Network of Schools（强连通 + 缩点）

裸题，如何通过加最少的边把一个图变成强连通图

步骤：

1.求原图构成几个强连通图

2.把每一个强连通图视为一个点，进行缩点操作

3.记录每一个点的入度和出度之和，max（出度， 入度）就是最终答案

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define ll long long
#define mod 1000000007
#define inf 0x3f3f3f3f
using namespace std;
const int maxn = 105;
int head[maxn], low[maxn], dfn[maxn],stk[maxn];
bool vis[maxn];
int cnt1, cnt, tot, index;
int belong[maxn], in[maxn], out[maxn];
int n;
struct node
{
    int to, next;
}e[maxn*maxn];
void init()
{
    cnt = cnt1 = tot = index = 0;
    memset(vis, 0, sizeof(vis));
    memset(dfn, 0, sizeof(dfn));
    memset(low, 0, sizeof(low));
    memset(head, -1, sizeof(head));
    memset(in, 0, sizeof(in));
    memset(out, 0, sizeof(out));
}
void addedge(int u, int v)
{
    e[cnt1].to = v;
    e[cnt1].next = head[u];
    head[u] = cnt1 ++;
}
void tarjan(int x)
{
    dfn[x] = low[x] = ++ tot;
    stk[++ index] = x;
    vis[x] = 1;
    for(int i = head[x]; ~i; i = e[i].next)
    {
        if(! dfn[e[i].to])
        {
            tarjan(e[i].to);
            low[x] = min(low[x], low[e[i].to]);
        }
        else if(vis[e[i].to])
            low[x] = min(low[x], dfn[e[i].to]);
    }
    if(low[x] == dfn[x])
    {
        cnt ++;
        while(x != stk[index + 1])
        {
            belong[stk[index]] = cnt;
            vis[stk[index]] = 0;
            index --;
        }
    }
}
int main()
{
    while(scanf("%d", &n) != EOF)
    {
        init();
        int x;
        for(int i = 1; i <= n; i ++)
        {
            while(scanf("%d", &x))
            {
                if(x == 0) break;
                addedge(i, x);
            }
        }
        for(int i = 1; i <= n; i ++)
        {
            if(! dfn[i])
                tarjan(i);
        }
        for(int i = 1; i <= n; i ++)
        {
            for(int j = head[i]; ~j; j = e[j].next)
            {
                int v = e[j].to;
                if(belong[i] != belong[v])
                {
                    out[belong[i]] ++;
                    in[belong[v]] ++;
                }
            }
        }
        int ans1 = 0, ans2 = 0;
        for(int i = 1; i <= cnt; i ++)
        {
            if(! in[i]) ans1 ++;
            if(! out[i]) ans2 ++;
        }
        int ans3 = max(ans1, ans2);
        if(cnt == 1) printf("1\n0\n");
        else printf("%d\n%d\n", ans1, ans3);
    }
    return 0;
}