求调,TIM了

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
int n,m;
int u,v;
vector< vector<int> > g;
vector<bool> vis;
int k = -1;
void bfs(int x)
{
    vis[x] = false;
    queue<int> q;
    q.push(x);
    while (!q.empty())
    {
        int y = q.front();
        q.pop();
        k = max(k,y);
        for (int i : g[y])
        {
            if (!vis[i])
                continue;
            vis[i] = false;
            q.push(i);
        }
    }
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m;
    g.resize(n + 3);
    vis.resize(n + 3,true);
    for (int i = 1;i <= m;i++)
    {
        cin >> u >> v;
        g[u].push_back(v);
    }
    for (int i = 1;i <= n;i++)
    {
        fill(vis.begin(),vis.end(),true);
        k = -1;
        bfs(i);
        cout << k << ' ';
    }
    return 0;
}