-
Notifications
You must be signed in to change notification settings - Fork 0
/
PT07Z.cpp
64 lines (61 loc) · 1.13 KB
/
PT07Z.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
63
64
#include<bits/stdc++.h>
using namespace std;
vector<int>adj[100000];
int arr[100000]={0};
int arr2[100000]={0};
void dfs(int s,int count)
{
//cout<<"hi"<<endl;
arr[s]=count;
for(int i=0;i<adj[s].size();i++)
{
if(arr[adj[s][i]]==0)
dfs(adj[s][i],count+1);
}
}
void dfs1(int s,int count)
{
arr2[s]=count;
for(int i=0;i<adj[s].size();i++)
{
if(arr2[adj[s][i]]==0)
dfs(adj[s][i],count+1);
}
}
int main(void)
{
int n,u,v;
cin>>n;
for(int i=1;i<=n-1;i++)
{
cin>>u>>v;
adj[u].push_back(v);
adj[v].push_back(u);
}
//cout<<"hi";
int count=1;
dfs(1,count);
int max=0,pos=0;
for(int i=1;i<=n;i++)
{
if(arr[i]>max)
{
max=arr[i];
pos=i;
}
}
count=1;
//cout<<max<<pos<<endl;
//cout<<pos;
memset (arr,0,sizeof(arr));
count=1;
dfs(pos,count);
//dfs1(pos,count);
max=0;
for(int i=1;i<=n;i++)
{
if(arr[i]>max)
max=arr[i];
}
cout<<max-1;
}