HDU4417 主席树入门2

Description
Mario is world-famous plumber. His “burly” figure and amazing jumping ability reminded in our memory. Now the poor princess is in trouble again and Mario needs to save his lover. We regard the road to the boss’s castle as a line (the length is n), on every integer point i there is a brick on height hi. Now the question is how many bricks in [L, R] Mario can hit if the maximal height he can jump is H.
Input
The first line follows an integer T, the number of test data.
For each test data:
The first line contains two integers n, m (1 <= n <=10^5, 1 <= m <= 10^5), n is the length of the road, m is the number of queries.
Next line contains n integers, the height of each brick, the range is [0, 1000000000].
Next m lines, each line contains three integers L, R,H.( 0 <= L <= R < n 0 <= H <= 1000000000.)
Output
For each case, output “Case X: ” (X is the case number starting from 1) followed by m lines, each line contains an integer. The ith integer is the number of bricks Mario can hit for the ith query.
Sample Input
1
10 10
0 5 2 7 5 4 3 8 7 7
2 8 6
3 5 0
1 3 1
1 9 4
0 1 0
3 5 5
5 5 1
4 6 3
1 5 7
5 7 3
Sample Output
Case 1:
4
0
0
3
1
2
0
1
5
1

这个题和上个题差不多…
但是有不少需要以后写主席树注意的事情
第一个是查询的时候注意lowerbound的问题
它会返回第一个不比他小的
upperbound返回第一个比他大的
记住….

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<memory.h>
using namespace std;
int shuru[100001],tu[100001],zuo[2000001],you[2000001],su[2000001],shu[100001],tou;
int gengxin(int shangyike,int weizhi,int zo,int yo)
{int xianzai=++tou;if(zo==yo){su[xianzai]=su[shangyike]+1;return xianzai;}int mid=(zo+yo)/2;if (weizhi <= mid){you[xianzai] = you[shangyike];zuo[xianzai] = gengxin(zuo[shangyike], weizhi, zo, mid);}else{you[xianzai] = gengxin(you[shangyike], weizhi, mid + 1, yo);zuo[xianzai] = zuo[shangyike];}su[xianzai] = su[zuo[xianzai]] + su[you[xianzai]];return xianzai;
}
int wen(int qian, int hou, int zo, int yo, int k)
{if(yo<=k)return su[hou]-su[qian];else if(zo>k)return 0;else{int mid=(zo+yo)/2;int zoz=wen(zuo[qian],zuo[hou],zo,mid,k);int yoy=wen(you[qian],you[hou],mid+1,yo,k);return zoz+yoy;}
}
int main()
{int T;int u=0;cin>>T;while(T--){tou=0;memset(tu,0,sizeof(tu));memset(zuo,0,sizeof(zuo));memset(you,0,sizeof(you));memset(su,0,sizeof(su));memset(shu,0,sizeof(shu));int n,m;cin>>n>>m;for(int a=1;a<=n;a++){scanf("%d",&shuru[a]);tu[a]=shuru[a];}sort(tu+1,tu+n+1);printf("Case %d:\n",++u);int lisa=unique(tu+1,tu+n+1)-tu-1;//shu[0]=jianli(1,lisa);int q,w,e;for(int a=1;a<=n;a++){int weizhi=lower_bound(tu+1,tu+lisa+1,shuru[a])-tu;shu[a]=gengxin(shu[a-1],weizhi,1,lisa);}while (m--){int q, w, e;cin >> q >> w >> e;q++,w++;e=upper_bound(tu+1,tu+lisa+1,e)-tu-1;cout << wen(shu[q-1], shu[w], 1, lisa, e) << endl;}}return 0;
}

HDU4417 主席树入门2相关推荐

poj2104 k-th number 主席树入门讲解
poj2104 k-th number 主席树入门讲解定义:主席树是一种可持久化的线段树又叫函数式线段树刚开始学是不是觉得很蒙逼啊其实我也是主席树说简单了就是保留你每一步操作完成之后 ...
【模板】可持久化线段树 1（主席树）
题目背景这是个非常经典的主席树入门题--静态区间第K小数据已经过加强,请使用主席树.同时请注意常数优化题目描述如题,给定N个正整数构成的序列,将对于指定的闭区间查询其区间内的第K小值. 输入输 ...
【用学校抄作业带你走进可持久化线段树(主席树)】可持久化线段树概念+全套模板+例题入门：[福利]可持久化线段树)
我似乎很少写这种算法博客可持久化线段树概念概念介绍(类比帮助理解) 简单分析一下时间和空间复杂度(内容池) 模板结构体变量建树模板单点修改模板单点查询模板区间修改模板(pushup) 区 ...
线段树简单入门 (含普通线段树, zkw线段树, 主席树)
线段树简单入门递归版线段树线段树的定义线段树, 顾名思义, 就是每个节点表示一个区间. 线段树通常维护一些区间的值, 例如区间和. 比如, 上图 \([2, 5]\) 区间的和, 为以下区间的和 ...
【代码源 Div1 - 108】#464. 数数（主席树，区间比k小的数的个数）HDU4417
problem solution 主席树查询区间比k小的数的个数建树之后直接在目标区间的主席树内将 H 作为挡板递归计数. #include<bits/stdc++.h> using n ...
HDU-4417 Super Mario (主席树)
Mario is world-famous plumber. His "burly" figure and amazing jumping ability reminded in ...
HDU4417 Super Mario （主席树模板）
Super Mario Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Tota ...
HDU4417 Super Mario(离线树状数组或者主席树+二分)
Super Mario Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Tota ...
NOI数据结构：主席树
主席树详解主席树详解_西红柿爱炒番茄-CSDN博客最详细的主席树(不修改,待修改) BZOJ 1901 最详细的主席树(不修改,待修改) BZOJ 1901_Bartholomew_的博客-CSD ...

HDU4417 主席树入门2

HDU4417 主席树入门2相关推荐

最新文章

热门文章