HYSBZ 1036 树的统计Count
题目链接
就树链剖分,线段树维护sum和maxx即可
代码:
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
const int N = 30005;
int dep[N], fa[N], son[N], sz[N], top[N], id[N], idx, val[N];
int first[N], next[N * 2], vv[N * 2], en;
void init() {
en = 0;
idx = 0;
memset(first, -1, sizeof(first));
}
void add_Edge(int u, int v) {
vv[en] = v;
next[en] = first[u];
first[u] = en++;
}
void ......
阅读全文