-
Notifications
You must be signed in to change notification settings - Fork 0
/
C2.cpp
62 lines (46 loc) · 1.03 KB
/
C2.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define endl "\n"
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
ll const inf = 1e18;
ll const maxn = 1e6+5;
ll const mod = 1e9+7;
// code begins here
vector<ll> v[maxn], depth(maxn);
void dfs(ll i, ll p=0){
for(auto u: v[i]){
if(u!=p){
depth[u] = depth[i] + 1;
dfs(u, i);
}
}
}
ll diameter(ll n){
fill(depth.begin(), depth.end(), 0);
dfs(1);
ll mx = -1, pos;
for(ll i=1;i<=n;i++){
if(depth[i]>mx)
pos = i;
mx = max(mx, depth[i]);
}
fill(depth.begin(), depth.end(), 0);
dfs(pos);
mx = *max_element(depth.begin(), depth.end());
return mx;
}
int main(){
fast;
ll n, m, a, b;
cin>>n>>m;
for(ll i=0;i<m;i++){
cin>>a>>b;
v[a].push_back(b);
v[b].push_back(a);
}
ll ans = diameter(n);
cout<<ans<<endl;
return 0;
}