Dikea's Blog

#include using namespace std; #define maxn 100000 + 10 struct Edge { int v; int next; } e[maxn<<1]; int head[maxn], cnt; void adde(int u, int v) //单向边 { e[cnt].v = v; e[cnt].next

pog loves szh III    Accepts: 63    Submissions: 483  Time Limit: 12000/6000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) 问题描述 pog在与szh玩游戏，首先pog在纸上画了一棵有根树，这里我们定义1