03 2018 档案

LCT板子
摘要：#include const int MAXN=1e5+10; #define ll long long using namespace std; int ch[MAXN][2],res[MAXN],pre[MAXN];bool rt[MAXN]; ll size1[MAXN],size[MAXN];int st[MAXN],tp; typedef struct node{ int u,v;l... 阅读全文
posted @ 2018-03-29 22:11 wang9897 阅读(280) 评论(0) 推荐(0)
spoj COT - Count on a tree
摘要：COT - Count on a tree #tree #tree You are given a tree with N nodes. The tree nodes are numbered from 1 to N. Each node has an integer weight. We will 阅读全文
posted @ 2018-03-28 20:15 wang9897 阅读(293) 评论(0) 推荐(0)