【BZOJ1803】Spoj1487 Query on a tree III 主席树+DFS序
2024-08-30 13:47:51
【BZOJ1803】Spoj1487 Query on a tree III
Description
You are given a node-labeled rooted tree with n nodes. Define the query (x, k): Find the node whose label is k-th largest in the subtree of the node x. Assume no two nodes have the same labels.
Input
The first line contains one integer n (1 <= n <= 10^5). The next line contains n integers li (0 <= li <= 109) which denotes the label of the i-th node. Each line of the following n - 1 lines contains two integers u, v. They denote there is an edge between node u and node v. Node 1 is the root of the tree. The next line contains one integer m (1 <= m <= 10^4) which denotes the number of the queries. Each line of the next m contains two integers x, k. (k <= the total node number in the subtree of x)
Output
For each query (x, k), output the index of the node whose label is the k-th largest in the subtree of the node x.
Sample Input
5
1 3 5 2 7
1 2
2 3
1 4
3 5
4
2
3
4 1
3 2
3 2
Sample Output
5 4 5 5
题解:这样例你告诉我是求子树第k大?(the k_th largest)分明是第k小啊!
直接主席树+DFS序搞定。
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn=100010;
int n,m,cnt,tot;
int to[maxn<<1],next[maxn<<1],head[maxn],v[maxn],p[maxn],q[maxn],rt[maxn];
int ls[maxn*30],rs[maxn*30],siz[maxn*30],s[maxn*30];
struct number
{
int val,org;
}num[maxn];
bool cmp(number a,number b)
{
return a.val<b.val;
}
void insert(int x,int &y,int l,int r,int a,int b)
{
if(l>r) return ;
y=++tot,siz[y]=siz[x]+1;
if(l==r)
{
s[y]=b;
return ;
}
int mid=l+r>>1;
if(a<=mid) rs[y]=rs[x],insert(ls[x],ls[y],l,mid,a,b);
else ls[y]=ls[x],insert(rs[x],rs[y],mid+1,r,a,b);
}
int query(int a,int b,int l,int r,int c)
{
if(l==r) return s[a];
int mid=l+r>>1,sm=siz[ls[a]]-siz[ls[b]];
if(c<=sm) return query(ls[a],ls[b],l,mid,c);
else return query(rs[a],rs[b],mid+1,r,c-sm);
}
void dfs(int x,int fa)
{
p[x]=++p[0];
insert(rt[p[0]-1],rt[p[0]],1,n,v[x],x);
for(int i=head[x];i!=-1;i=next[i]) if(to[i]!=fa) dfs(to[i],x);
q[x]=p[0];
}
void add(int a,int b)
{
to[cnt]=b,next[cnt]=head[a],head[a]=cnt++;
}
int main()
{
scanf("%d",&n);
int i,a,b;
for(i=1;i<=n;i++) scanf("%d",&num[i].val),num[i].org=i;
sort(num+1,num+n+1,cmp);
for(i=1;i<=n;i++) v[num[i].org]=i;
memset(head,-1,sizeof(head));
for(i=1;i<n;i++)
{
scanf("%d%d",&a,&b);
add(a,b),add(b,a);
}
dfs(1,0);
scanf("%d",&m);
for(i=1;i<=m;i++)
{
scanf("%d%d",&a,&b);
printf("%d\n",query(rt[q[a]],rt[p[a]-1],1,n,b));
}
return 0;
}
最新文章
- ig WebDataGrid清除选中行
- Lua学习---Lua的控制结构
- 关于出现 org.apache.commons.lang.exception.NestableRuntimeException的解决方法
- IOS 免受xib自动布局影响
- 前端必杀技之Javascript 第1天
- 如何保护 .NET 应用的安全?
- 【c语言】推断一个数是不是2的n次方
- spring容器启动的加载过程(二)
- Kettle文本文件输出和输入控件使用中,换行符导致的问题处理
- Java中的String,StringBuilder,StringBuffer三者的区别
- 测试12.2.0.1RAC PDB级别的Failover
- 如何使用Scrapy框架实现网络爬虫
- Docker Kubernetes 介绍 or 工作原理
- vue实现带规格商品的表格编辑
- python用win32pdh模块查看进程信息
- ASP.NET Core Web API 索引 (更新Redis in .NET Core)
- 创建私有maven服务器
- 用vue实现省市县三级联动
- OC开发_Storyboard——绘制和视图
- 【Android】WebView读取本地图片
热门文章
- Ios 调用Appstore 下载界面 [[UIApplication sharedApplication] openURL
- IOS AppUI规格指南
- JavaScript原生函数(内置函数)
- Linux 多线程环境下 进程线程终止函数小结(转)
- iOSQuart2D绘图之UIImage简单使用
- Nginx Errors: upstream response cache error
- Predix中模型设计
- webpack 打包压缩 ES6文件报错UglifyJs + Unexpected token punc ((); 或者 Unexpected token: operator (>;)
- div横向排列
- 【Nginx-反向代理server】基础知识(二)之多进程模式