HDU4635 Strongly connected (tarjan)

题意：给定一个图，问求最多能添加多少边使得该图不是强连通图。

思路：对于一个有n个顶点的有向图，最多有n*(n-1)条边，为了使得添加的边最多，则应该使得最后添边后的强连通子图最少，也就是为2个；然后缩点，计算新点的各点的入度和出度，选择出度或者入度最小的点（因为两者之差越大（和固定），乘积就越小）

 

 

 

#include <cstdio>
#include <stack>
#include <cstring>
#include <algorithm>
#define LL long long
#define inf 0x3f3f3f3f
using namespace std;

const int maxn = 1e5 + 10;
int n, t, m, cnt, dfs_clock, scc_cnt, pre[maxn], sccno[maxn], lowlink[maxn], head[maxn];
int in[maxn], out[maxn], cas = 0, num[maxn];
struct Edge{
    int to,next;
}edge[maxn];
stack<int> S;

void add(int u, int v){
    edge[cnt].to = v;
    edge[cnt].next = head[u];
    head[u] = cnt ++;
}

void init(){
    memset(head,-1,sizeof(head));
    memset(pre,0,sizeof(pre));
    memset(sccno,0,sizeof(sccno));
    memset(num,0,sizeof(num));
    memset(in,0,sizeof(in));
    memset(out,0,sizeof(out));
    cnt = dfs_clock = scc_cnt = 0;

    int u,v;
    for(int i = 0; i < m; i ++){
        scanf("%d%d",&u,&v);
        add(u,v);
    }
}

void dfs(int u){
    pre[u] = lowlink[u] = ++ dfs_clock;
    S.push(u);
    for(int i = head[u]; i != -1; i = edge[i].next){
        int v = edge[i].to;
        if(!pre[v]){
            dfs(v);
            lowlink[u] = min(lowlink[u], lowlink[v]);
        }
        else if(!sccno[v]) lowlink[u] = min(lowlink[u], pre[v]);
    }
    if(lowlink[u] == pre[u]){
        scc_cnt ++;
        for(;;){
            int x = S.top(); S.pop();
            num[scc_cnt] ++;
            sccno[x] = scc_cnt;
            if(x == u) break;
        }
    }
}

void solve(){
    for(int i = 1; i <= n; i ++){
        if(!pre[i]) dfs(i);
    }

    if(scc_cnt == 1){
        printf("Case %d: -1\n",++ cas);
        return ;
    }

    for(int u = 1; u <= n; u ++){
        for(int i = head[u]; i != -1; i = edge[i].next){
            int v = edge[i].to;
            int x = sccno[u], y = sccno[v];
            if(x != y){
                out[x] ++;
                in[y] ++;
            }
        }
    }
    LL ans = (LL)n * (n - 1) - m;
    int min_num = inf;
    for(int i = 1; i <= scc_cnt; i ++){
        if(!in[i] || !out[i]) min_num = min(min_num, num[i]);
    }
    ans -= (LL)min_num * (n - min_num);
    printf("Case %d: %lld\n",++cas, ans);
}

int main(){
    scanf("%d",&t);
    while(t --){
        scanf("%d%d",&n,&m);
        init();
        solve();
    }
    return 0;
}