hdu 3639

tarjan缩点，每个点的权值是点包含的人数，反向建图，选出当老鹰的一定是在入度为零的点中，跑一边dfs算入度为零的点可以到达的所有点的权值加起来是多少，加起来最大的就是了
注意去重边

#include <bits/stdc++.h>
using namespace std;
const int maxN=5e3+5;
const int maxM=3e4+5;
int N,M;
int head1[maxN],tol1,head2[maxN],tol2;
struct Graph
{
    int from,to,next;
} path1[maxM],path2[maxM];
void add(Graph *path,int *head,int &tol,int u,int v)
{
    path[tol]= {u,v,head[u]};
    head[u]=tol++;
}
int low[maxN],dfn[maxN],insta[maxN],scc[maxN],w[maxN],cnt,tim;
stack<int> sta;
int in[maxN],out[maxN];
int ans[maxN],tol3;
int vis[maxN];
map<int,int> ma;//去重边用
void init()
{
    memset(head1,-1,sizeof(head1));
    memset(head2,-1,sizeof(head2));
    cnt=tol1=tol2=tol3=0;
    memset(dfn,0,sizeof(dfn));
    memset(low,0,sizeof(low));
    memset(w,0,sizeof(w));
    tim=1;
    memset(in,0,sizeof(in));
    memset(out,0,sizeof(out));
    ma.clear();
}
void tarjan(int u)
{
    dfn[u]=low[u]=++tim;
    sta.push(u);
    insta[u]=1;
    for(int i=head1[u]; i!=-1; i=path1[i].next)
    {
        int v=path1[i].to;
        if(!dfn[v])
        {
            tarjan(v);
            low[u]=min(low[u],low[v]);
        }
        else if(insta[v])low[u]=min(low[u],low[v]);
    }
    if(dfn[u]==low[u])
    {
        cnt++;
        int m;
        do
        {
            m=sta.top();
            sta.pop();
            insta[m]=0;
            scc[m]=cnt;
            w[cnt]++;
        }
        while(u!=m);
    }
}
int dfs(int u,int fa)
{
    if(vis[u])return 0;
    vis[u]=1;
    int sum=w[u];
    for(int i=head2[u]; i!=-1; i=path2[i].next)
    {
        int v=path2[i].to;
        if(v==fa)continue;
        sum+=dfs(v,u);
    }
    return sum;
}
int main()
{
    int T,cas=1;
    scanf("%d",&T);
    while(T--)
    {
        init();
        scanf("%d%d",&N,&M);
        int u,v;
        while(M--)
        {
            scanf("%d%d",&u,&v);
            add(path1,head1,tol1,u,v);
        }
        for(int i=0; i<N; i++)if(!dfn[i])tarjan(i);
        for(int i=0; i<tol1; i++)
        {
            u=path1[i].from;
            v=path1[i].to;
            if(scc[u]!=scc[v]&&ma[scc[v]]!=scc[u])
            {
                ma[scc[v]]=scc[u];
                add(path2,head2,tol2,scc[v],scc[u]);//建反图
                in[scc[u]]++;
                out[scc[v]]++;
            }
        }
        int maxx=-1;
        for(int i=1; i<=cnt; i++)
            if(!in[i])
            {
                memset(vis,0,sizeof(vis));
                maxx=max(maxx,w[i]=dfs(i,i));
            }
        for(int i=1; i<=cnt; i++)if(w[i]==maxx)ans[++tol3]=i;
        queue<int> mdzz;
        while(!mdzz.empty())mdzz.pop();
        printf("Case %d: %d\n",cas++,maxx-1);
        for(int i=0; i<N; i++)
            for(int j=1; j<=tol3; j++)
                if(scc[i]==ans[j])
                {
                    mdzz.push(i);
                    break;
                }
        printf("%d",mdzz.front());
        mdzz.pop();
        while(!mdzz.empty())
        {
            printf(" %d",mdzz.front());
            mdzz.pop();
        }
        printf("\n");
    }
    return 0;
}