# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
83984 | Linst90 | 새로운 문제 (POI13_luk) | C++11 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<iostream>
#include<vector>
using namespace::std;
int delay[300005];
vector<vector<int>> v;
void DFS(int i,int d){
//cout<<i<<'\n';
delay[i]=d;
for(auto a:v[i]){
//cout<<a<<'\n';
if(a!=1&&!delay[a]){
DFS(a,d+1);
}
}
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin>>n;
for(int i=0;i<n+1;i++){
vector<int> t;
v.push_back(t);
}
for(int i=0,l,r;i<n-1;i++){
cin>>l>>r;
//delay[i+1]=-1;
v[l].push_back(r);
v[r].push_back(l);
}
DFS(1,0);
int maxn=0;
for(int i=1;i<=n;i++){
//cout<<i<<' '<<v[i].end()-v[i].begin()-delay[i]<<'\n';
maxn=max(maxn,v[i].end()-v[i].begin()-delay[i]);
}
cout<<maxn<<'\n';
}