题目链接
题意:略:
解答:缩点后,计算连通分量里 的点数
,但是最后一个case无法通过。貌似是爆栈了,只得到了90分
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
using namespace std;
#define LL long long
#define pb push_back
#define X first
#define Y second
#define cl(a,b) memset(a,b,sizeof(a))
typedef pair<int,int> P;
const int maxn=300005;
const LL inf=1<<27;
const LL mod=1e9+7;
vector<int> G[maxn];
int dfn[maxn],low[maxn],s[maxn];
int belong[maxn];
bool ins[maxn];
int cnt,num,top;
int my[maxn];
void dfs(int u){
dfn[u]=low[u]=++num;
s[++top]=u;
ins[u]=true;
int N=G[u].size();
for(int i=0;i<N;i++){
int v=G[u][i];
if(!dfn[v]){
dfs(v);
low[u]=min(low[u],low[v]);
}
else if(ins[v]&&dfn[v]<low[u]){
low[u]=dfn[v];
}
}
if(low[u]==dfn[u]){
cnt++;
int v;
do{
v=s[top--];
ins[v]=false;
belong[v]=cnt;
my[cnt]++;
}while(v!=u);
}
}
void Tarjan(int n){
cnt=num=top=0;
cl(dfn,0);
cl(ins,false);
cl(my,0);
cl(belong,0);
for(int i=1;i<=n;i++)if(!dfn[i]){
dfs(i);
}
}
int main(){
int n;scanf("%d",&n);
for(int i=1;i<=n;i++){
int x;scanf("%d",&x);G[i].pb(x);
}
Tarjan(n);
int ans=inf;
for(int i=1;i<=cnt;i++)if(my[i]>1){
ans=min(ans,my[i]);
}
printf("%d\n",ans);
return 0;
}