CF1039D You are given a tree

#include <bits/stdc++.h> const int N=100005; int edge,last[N],dp[N],ans[N],cnt,n,x,y,Ans,dfn[N],idn,f[N]; struct Edge{ int to,Next; }e[N<<1]; void add
posted @ 2021-02-06 12:11  flyfeather  阅读(77)  评论(0)  编辑  收藏  举报