hiho Week 11 register

Ended

Participants:433

Verdict:Accepted
Score:100 / 100
Submitted:2014-09-13 21:56:33

Lang:G++

Edit
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
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <cmath>
#define mod 1000000007
using namespace std;
vector <int> edges[100008];
int maxn,nown;
void dfs(int u,int dep,int fa)
{
    if(dep>maxn)    {maxn=dep;nown=u;}
    for(int i=0;i<(int)edges[u].size();i++)
    {
        int v=edges[u][i];
        if(v!=fa)   dfs(v,dep+1,u);
    }
}
int main()
{
    int n,i;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
        edges[i].clear();
    for(i=1;i<n;i++)
    {
        int u,v;
        scanf("%d%d",&u,&v);
        edges[u].push_back(v);
        edges[v].push_back(u);
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX