hihoCoder Challenge 14 register

Ended

Participants:709

Verdict:Accepted
Submitted:2015-08-30 19:24:53

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<cstdio> 
#include<cstring>
#include<iostream>
#include<algorithm>
#define maxn 105000
#define inf 0x3f3f3f3f
#define next nex
using namespace std;
int n,tot=0;
int imax=0,ans=0;
int size[maxn];
int head[maxn],next[maxn],edge[maxn];
void join(int u,int v)
{
    edge[tot]=v; 
    next[tot]=head[u]; head[u]=tot++;
}
void init()
{
    memset(head,-1,sizeof(head));
    scanf("%d",&n);
    for (int k=1;k<n;++k)
    {
        int x,y;
        scanf("%d%d",&x,&y);
        join(x,y);
    }
}
void dfs(int i,int deep)
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX