#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxn = 1e6 + 5;
const ll MOD = 1e9 + 7;
const ll INF = 0x7fffffff;
vector<int> g[maxn];
int ans[maxn];
int dfs(int u) {
if (ans[u])return ans[u];
ans[u] = 1;
for (int i = 0; i < g[u].size(); i++) {
int v = g[u][i];
if (g[v].size()>g[u].size()) {
ans[u]=max(ans[u],dfs(v)+1);
}
}
return ans[u];
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(0);
ll n,m;
cin >> n >> m;
int u, v;
while (m--) {
cin >> u >> v;
g[u].push_back(v);
g[v].push_back(u);
}
int t = -1;
for (int i = 0; i < n; i++) {
t=max(t,dfs(i));
}
cout << t;
return 0;
}
2021年度训练联盟热身训练赛第四场Game Map DFS
最新推荐文章于 2021-04-13 07:15:33 发布