题目:http://acm.hdu.edu.cn/showproblem.php?pid=4358
题意:给定一个以1为根的树,树上每个节点都有权值,然后问以某点v为根的子树中有多少个出现次数等于k的权值
思路:首先权值要离散化,对于树结构,用dfs序转换成线性结构,即以v为根的子树线性区间为[in[v], out[v]],这样就可以用莫队算法乱搞了
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#define debug() puts("here")
using namespace std;
const int N = 100010;
struct edge
{
int to, next;
}g[N*2];
struct node
{
int l, r, id;
}q[N];
int cnt, head[N];
int n, m, k, unit, tmp, cas;
int a[N], b[N], c[N], arr[N], in[N], out[N], num[N], val[N], res[N], tot;
void add_edge(int v, int u)
{
g[cnt].to = u, g[cnt].next = head[v], head[v] = cnt++;
}
void dfs(int v, int fa)
{
in[v] = ++tot;
val[tot] = a[v];//把节点的权值映射到线性区间上
for(int i = head[v]; i != -1; i = g[i].next)
{
int u = g[i].to;
if(u != fa) dfs(u, v);
}
out[v] = tot;
}
bool cmp(node a, node b)
{
return a.l/unit != b.l/unit ? a.l/unit < b.l/unit : a.r < b.r;
}
void add(int i)
{
num[i]++;
if(num[i] == k) tmp++;
else if(num[i] == k + 1) tmp--;
}
void del(int i)
{
num[i]--;
if(num[i] == k) tmp++;
else if(num[i] == k - 1) tmp--;
}
void solve()
{
tot = 0;
dfs(1, -1);
for(int i = 1; i <= m; i++)
q[i].id = i, q[i].l = in[arr[i]], q[i].r = out[arr[i]];
unit = (int)sqrt(1.0*n);
sort(q+1, q+1+m, cmp);
memset(num, 0, sizeof num);
int l = 1, r = 0;
tmp = 0;
for(int i = 1; i <= m; i++)
{
while(r < q[i].r) add(val[++r]);
while(r > q[i].r) del(val[r--]);
while(l < q[i].l) del(val[l++]);
while(l > q[i].l) add(val[--l]);
res[q[i].id] = tmp;
}
printf("Case #%d:\n", ++cas);
for(int i = 1; i <= m; i++) printf("%d\n", res[i]);
}
int main()
{
int t;
scanf("%d", &t);
while(t--)
{
scanf("%d%d", &n, &k);
for(int i = 1; i <= n; i++) scanf("%d", &a[i]), b[i] = a[i];
sort(b+1, b+1+n);
for(int i = 1; i <= n; i++) a[i] = lower_bound(b+1, b+1+n, a[i]) - b;
cnt = 0;
memset(head, -1, sizeof head);
int v, u;
for(int i = 1; i <= n - 1; i++)
{
scanf("%d%d", &v, &u);
add_edge(v, u), add_edge(u, v);
}
scanf("%d", &m);
for(int i = 1; i <= m; i++) scanf("%d", &arr[i]);
solve();
if(t) printf("\n");
}
return 0;
}