Graph (dfs)

#include<iostream>
#include<cstdio>
using namespace std;
struct edge{
    int to,next;
}e[200001];
int n,m,cnt,now,head[200001],f[200001];
bool vis[200001];
void ins(int u,int v){
    e[++cnt]=(edge){v,head[u]};head[u]=cnt;
}
void dfs(int x){
    vis[x]=1;
     for(int i=head[x];i;i=e[i].next)
        if(!vis[e[i].to]){
            dfs(e[i].to);
            f[e[i].to]=max(f[e[i].to],now);
        }
}
int main(){
    freopen("graph.in","r",stdin);
    freopen("graph.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
        f[i]=i;
    for(int i=1;i<=m;i++){
        int a,b;
        scanf("%d%d",&a,&b);
        ins(b,a);
    }
    for(int i=n;i>=1;i--)
        if(!vis[i])now=i,dfs(i);
    for(int i=1;i<=n;i++)
        printf("%d ",f[i]);
    return 0;
}