poj2553 The Bottom of a Graph

bottom(G)={v∈V|∀w∈V:(v→w)⇒(w→v)}.列举G点中元素

做法：1.求scc2.统计scc中出度为0的点，列举即可

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
#include<vector>
#include<stack>
#define ll long long
#define INF 0x3f3f3f3f
#define maxn 20000
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;

int n,m;
int pre[maxn],lowin[maxn],sccno[maxn],dfs_clock,scc_cnt;
stack<int> S;
int out[maxn],ans[maxn],cnt;
vector<int> g[maxn],scc[maxn];

int dfs(int u){
    lowin[u]=pre[u]=++dfs_clock;
    S.push(u);
    for(int i=0;i<g[u].size();i++){
        int v=g[u][i];
        if(!pre[v]) { dfs(v);lowin[u]=min(lowin[u],lowin[v]); }
        else if(!sccno[v]) lowin[u]=min(lowin[u],pre[v]);
    }
    if(lowin[u]==pre[u]){
        scc_cnt++;
        for(;;){
            int x=S.top();S.pop();
            sccno[x]=scc_cnt;
            scc[scc_cnt].push_back(x);
            if(x==u) break;
        }
    }
}

void find_scc(){
    mem(pre,0),mem(sccno,0),dfs_clock=scc_cnt=0;
    for(int i=1;i<=n;i++) scc[i].clear();
    for(int i=1;i<=n;i++) if(!pre[i]) dfs(i);
}

void build(){
    scanf("%d",&m);
    for(int i=1;i<=n;i++) g[i].clear();
    for(int i=1;i<=m;i++){
        int a,b;
        scanf("%d%d",&a,&b);
        g[a].push_back(b);
    }
}

void cal_sccdegree(){
    mem(out,0);
    for(int u=1;u<=n;u++){
        for(int i=0;i<g[u].size();i++){
            int v=g[u][i];
            if(sccno[u]!=sccno[v]) out[sccno[u]]++;
        }
    }
}

int main(){
    //freopen("a.txt","r",stdin);
    while(scanf("%d",&n)!=EOF&&n){
        build();
        find_scc();
        cal_sccdegree();
        cnt=0;
        for(int i=1;i<=scc_cnt;i++) if(!out[i]){
            for(int j=0;j<scc[i].size();j++){
                ans[cnt++]=scc[i][j];
            }
        }
        sort(ans,ans+cnt);
        for(int i=0;i<cnt-1;i++) printf("%d ",ans[i]);
        printf("%d\n",ans[cnt-1]);
    }
}