HDU4635 Strongly connected【强连通】

题意：一个有向图，问最多加几条边后还不是强连通图

思路：如果有两个块A、B，A连向B，而B不连向A，这样满足题意。取缩点后入度或出入为0的块

ans = a*(a-1) + b*(b-1) + a*b - m         (a+b = n)

A里最多的边 加上B的，再加A连向B ，减去已有的边

ans = a*a + b*b +a*b - n - m

       = (a+b)*(a+b) -  a*b - n - m

       = n*n - n - m - a*b

要让a*b最小，a、b尽量分开

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<string>
#include<stdlib.h>
#include<math.h>
#include<vector>
#include<list>
#include<map>
#include<stack>
#include<queue>
#include<algorithm>
#include<numeric>
#include<functional>
using namespace std;
typedef long long ll;
const int maxn = 100005;

struct edge
{
	int to,next;
	bool cut;
}ed[maxn];
int head[maxn], tot;  
int Low[maxn], DFN[maxn], Stack[maxn];  
int Index, top,in[maxn],out[maxn],num[maxn];
bool Instack[maxn]; 
int block,belong[maxn];  
int bridge;

void init()
{
	memset(in,0,sizeof in);
	memset(out,0,sizeof out);
	memset(num,0,sizeof num);
	memset(head, -1, sizeof(head));  
    memset(DFN, 0, sizeof(DFN));   
    memset(Instack, false, sizeof(Instack));   
    block = tot = 0;
    Index = top = 0;
    bridge = 0;
} 

void Tarjan(int u,int pre)
{
    int v;
    Low[u] = DFN[u] = ++Index;
    Stack[top++] = u;
    Instack[u] = true;
    for(int i = head[u];i != -1;i = ed[i].next)
    {
        v = ed[i].to;
        if( !DFN[v] )
        {
            Tarjan(v,u);
            if( Low[u] > Low[v] )Low[u] = Low[v];
            if(Low[v] > DFN[u])
            {
                bridge++;
                ed[i].cut = true;
                ed[i^1].cut = true;
            }
        }
        else if( Instack[v] && Low[u] > DFN[v] )
            Low[u] = DFN[v];
    }
    if(Low[u] == DFN[u])
    {
        block++;
        do
        {
        	num[block]++;
            v = Stack[--top];
            Instack[v] = false;
            belong[v] = block;
        }
        while( v!=u );
    }
}

void add(int x,int y)
{
	ed[tot].to = y;
	ed[tot].next = head[x];
	ed[tot].cut = 0;
	head[x] = tot++;
}

void SCC(int n)  
{  
    for(int i=1; i<=n; i++)  
        if(!DFN[i])  
            Tarjan(i,-1);  
}

int main(void)
{
	int T,kase = 1,a,b,n,m;
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d%d",&n,&m);
		init();
		for(int i = 1; i <= m; i++)
		{
			scanf("%d%d",&a,&b);
			add(a,b);
		}
		SCC(n);
		for(int i = 1; i <= n; i++)
		{
			for(int j = head[i]; j != -1; j = ed[j].next)
			{
				if( belong[i] != belong[ ed[j].to ])
				{
					out[ belong[i] ]++;
					in[ belong[ed[j].to] ]++;
				}
			}
		}
		ll tp = 0x3f3f3f3f3f3f3f3f;		
		for(int i = 1; i <= block; i++)
		{
			if(!in[i] || !out[i])
			tp = min(tp,(ll)num[i]*(n-num[i]));
		}
		ll ans = (ll)n*n-n-m-tp;
		if(block == 1)
			printf("Case %d: -1\n",kase++);
		else
			printf("Case %d: %lld\n",kase++,ans);
	}
	return 0;
}