Method csz

code/graph/hld.cpp:16–19

    if (parent[v] == u) swap(u, v); assert(parent[u] == v);
    values.update(loc[u], c); }
  int csz(int u) {
    rep(i,0,size(adj[u])) if (adj[u][i] != parent[u])
      sz[u] += csz(adj[parent[adj[u][i]] = u][i]);
    return sz[u]; }
  void part(int u) {
    head[u] = curhead; loc[u] = curloc++;
    int best = -1;