Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- typedef long long lli;
- const int N=300010;
- vector<int> V[N];
- int par[N],dis[N];
- int main(){
- int n;
- scanf("%d",&n);
- for(int i=0;i<n-1;i++){
- int u,v;
- scanf("%d%d",&u,&v);
- if(u<v) V[u].push_back(v);
- else V[v].push_back(u);
- }
- vector<lli> dis(n+10,1);
- lli ans=0;
- for(int i=1;i<=n;i++){
- for(auto x:V[i]){
- dis[x]=max(dis[x],dis[i]+1);
- }
- ans=max(ans,dis[i]);
- }
- printf("%d",ans);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement