https://www.luogu.org/problemnew/show/P1726

題解：強連通分量

/* *@Author: STZG *@Language: C++ */ #include <bits/stdc++.h> #include<iostream> #include<algorithm> #include<cstdlib> #include<cstring> #include<cstdio> #include<string> #include<vector> #include<bitset> #include<queue> #include<deque> #include<stack> #include<cmath> #include<list> #include<map> #include<set> //#define DEBUG #define RI register int #define endl "\n" using namespace std; typedef long long ll; //typedef __int128 lll; const int N=1000000+10; const int M=100000+10; const int MOD=1e9+7; const double PI = acos(-1.0); const double EXP = 1E-8; const int INF = 0x3f3f3f3f; int t,n,m,k,p,l,r,u,v; int ans,cnt,flag,temp,sum,top,col; int a,b,c,sta[N],vis[N],low[N],dfn[N],si[N],co[N]; vector<int>G[N]; void Tarjan(int u){dfn[u]=low[u]=++sum;vis[u]=1;sta[++top]=u;for(int i=0,j=G[u].size();i<j;i++){int v=G[u][i];if(!dfn[v]){Tarjan(v);low[u]=min(low[v],low[u]);}else if(vis[v]){low[u]=min(dfn[v],low[u]);}}if(dfn[u]==low[u]){co[u]=++col;++si[col];while(sta[top]!=u){++si[col];co[sta[top]]=col;vis[sta[top]]=0;--top;}vis[sta[top]]=0;--top;}} int main() { #ifdef DEBUGfreopen("input.in", "r", stdin);//freopen("output.out", "w", stdout); #endif//ios::sync_with_stdio(false);//cin.tie(0);//cout.tie(0);//scanf("%d",&t);//while(t--){scanf("%d%d",&n,&m);for(int i=1;i<=m;i++){scanf("%d%d%d",&a,&b,&k);if(k==1){G[a].push_back(b);}else if(k==2){G[a].push_back(b);G[b].push_back(a);}}for(int i=1;i<=n;i++)if(!dfn[i])Tarjan(i);for(int i=1;i<=col;i++)ans=max(ans,si[i]);cout<<ans<<endl;for(int i=1;i<=n;i++){if(si[co[i]]==ans){int now=co[i];for(int j=i;j<=n;j++)if(co[j]==now)cout<<j<<" ";break;}}//}#ifdef DEBUGprintf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC); #endif//cout << "Hello world!" << endl;return 0; }

?

總結(jié)

以上是生活随笔為你收集整理的上白泽慧音的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。