hdu 4635 Strongly connected 【图论-强连通分量-缩点-完全图】

                        Strongly connected

        Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Problem Description
Give a simple directed graph with N nodes and M edges. Please tell me the maximum number of the edges you can add that the graph is still a simple directed graph. Also, after you add these edges, this graph must NOT be strongly connected.
A simple directed graph is a directed graph having no multiple edges or graph loops.
A strongly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in the direction(s) in which they point.

Input
The first line of date is an integer T, which is the number of the text cases.
Then T cases follow, each case starts of two numbers N and M, 1<=N<=100000, 1<=M<=100000, representing the number of nodes and the number of edges, then M lines follow. Each line contains two integers x and y, means that there is a edge from x to y.

Output
For each case, you should output the maximum number of the edges you can add.
If the original graph is strongly connected, just output -1.

Sample Input
3
3 3
1 2
2 3
3 1
3 3
1 2
2 3
1 3
6 6
1 2
2 3
3 1
4 5
5 6
6 4

Sample Output
Case 1: -1
Case 2: 1
Case 3: 15

题目大意：给你一个DAG图,问你最多能添加多少条边使得这个DAG图依然不是强联通的;如果最初给的是scc图，直接输出-1；

相关知识点：
1. 完全有向图的边数：在一个n个结点的有向图中，最大边数为n*(n-1)。
2. 强联通分量
3. 缩点

解题思路（转自：http://blog.csdn.net/jarily/article/details/13627397）：
最终添加完边的图,肯定可以分成两个部X和Y,其中只有X到Y的边没有Y到X的边;
那么要使得边数尽可能的多,则X部肯定是一个完全图,Y部也是,同时X部中每个点到Y部的每个点都有一条边;
假设X部有x个点,Y部有y个点,则x+y=n;
同时边数F=x*y+x*(x-1)+y*(y-1),然后去掉已经有了的边m,则为答案;
当x+y为定值时,二者越接近,x*y越大，所以要使得边数最多,那么X部和Y部的点数的个数差距就要越大;
对于给定的有向图缩点,对于缩点后的每个点,如果它的出度或者入度为0,那么它才有可能成为X部或者Y部;
然后找出最大值即可;

下面给出图片演示：

当把第一个强连通分量看做是一个部（有x个点）的话， 则余下的点构成另外一个部（有y个点），则可以把这两个部看作两个图，再把这个两个部连成一个图，则这个完全总共有（x*y+x*(x-1)+y*(y-1）条边；

AC代码：

# include <cstdio>
# include <cstring>

# define MAXN 100005

struct EDGE
{
    int v;
    int next;
}edge[MAXN];
int tot;
int head[MAXN];
int dfn[MAXN];
int low[MAXN];
int belong[MAXN];
int stack[MAXN];
int instack[MAXN];
int sccson[MAXN];
int top;
int scc;
int index;

void Init()
{
    tot = top = scc = 0;
    index = 0;
    memset(head, -1, sizeof(head));
    memset(dfn, 0, sizeof(dfn));
    memset(instack, 0, sizeof(instack));
    memset(sccson, 0, sizeof(sccson));
}

void Addedge(int u, int v)
{
    edge[tot].v = v;
    edge[tot].next = head[u];
    head[u] = tot++;
}

void Tarjan(int u)
{
    int v;
    low[u] = dfn[u] = ++index;
    stack[top++] = u;
    instack[u] = 1;
    for (int i = head[u]; i != -1; i = edge[i].next)
    {
        v = edge[i].v;
        if (!dfn[v])
        {
            Tarjan(v);
            if (low[v] < low[u])
            {
                low[u] = low[v];
            }
        }
        else if (instack[v] && dfn[v] < low[u])
        {
            low[u] = dfn[v];
        }
    }
    if (low[u] == dfn[u])
    {
        scc++;
        do
        {
            v = stack[--top];
            instack[v] = 0;
            sccson[scc] ++;
            belong[v] = scc;
        } while (v != u);
    }
}

void Solve(int n, int m)
{
    int i;
    for (i = 1; i <= n; i++)
    {
        if (!dfn[i])
        {
            Tarjan(i);
        }
    }
    if (1 == scc)
    {
        printf("-1\n");
        return ;
    }
    //printf("scc = %d\n", scc);
    int in[MAXN];
    int out[MAXN];
    memset(in, 0, sizeof(in));
    memset(out, 0, sizeof(out));
    for (int u = 1; u <= n; u++)
    {
        for (i = head[u]; i != -1; i = edge[i].next)
        {
            int v = edge[i].v;
            if (belong[u] != belong[v])
            {
                in[belong[v]] ++;
                out[belong[u]] ++;
            }
        }
    }
    int result = 0;
    for (i = 1; i <= scc; i++)
    {
        if (!in[i] || !out[i])
        {
            int t = sccson[i];
            int temp = t * (t - 1) + (n - t) * (n - t - 1) + t * (n - t) - m;
            result = result > temp ? result : temp;
        }
    }
    printf("%d\n", result);
}

int main(void)
{
    int t;
    scanf("%d", &t);
    int count = 1;
    while (t--)
    {
        Init();
        int n, m;
        scanf("%d %d", &n, &m);
        for (int i = 0; i < m; i++)
        {
            int u, v;
            scanf("%d %d", &u, &v);
            Addedge(u, v);
        }
        printf("Case %d: ", count ++);
        Solve(n, m);
    }
    return 0;
}