hdoj The Water Problem 5443 (线段树区间最值问题)
来源:互联网 发布:最全小说软件 编辑:程序博客网 时间:2024/06/05 08:32
The Water Problem
Time Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 921 Accepted Submission(s): 731
Problem Description
In Land waterless, water is a very limited resource. People always fight for the biggest source of water. Given a sequence of water sources witha1,a2,a3,...,an representing the size of the water source. Given a set of queries each containing2 integers l and r , please find out the biggest water source between al and ar .
Input
First you are given an integer T(T≤10) indicating the number of test cases. For each test case, there is a number n(0≤n≤1000) on a line representing the number of water sources. n integers follow, respectively a1,a2,a3,...,an , and each integer is in {1,...,106} . On the next line, there is a number q(0≤q≤1000) representing the number of queries. After that, there will be q lines with two integers l and r(1≤l≤r≤n) indicating the range of which you should find out the biggest water source.
Output
For each query, output an integer representing the size of the biggest water source.
Sample Input
3110011 151 2 3 4 551 21 32 43 43 531 999999 141 11 22 33 3
Sample Output
1002344519999999999991#include<stdio.h>#include<string.h>#include<algorithm>#define N 1010using namespace std;int a[N];struct zz{int l;int r;int m;}q[4*N];void build(int gen,int l,int r){q[gen].l=l;q[gen].r=r;if(l==r){q[gen].m=a[l];return ;}int mid=(l+r)/2;build(gen<<1,l,mid);build(gen<<1|1,mid+1,r);q[gen].m=max(q[gen<<1].m,q[gen<<1|1].m);}int query(int gen,int l,int r){if(l<=q[gen].l&&r>=q[gen].r)return q[gen].m;int mid=(q[gen].l+q[gen].r)/2;int cnt;if(r<=mid)cnt=query(gen<<1,l,r);else if(l>=mid+1)cnt=query(gen<<1|1,l,r);elsecnt=max(query(gen<<1,l,mid),query(gen<<1|1,mid+1,r));return cnt;}int main(){int t,n,m,i;int x,y;scanf("%d",&t);while(t--){scanf("%d",&n);for(i=1;i<=n;i++)scanf("%d",&a[i]);build(1,1,n);scanf("%d",&m);while(m--){scanf("%d%d",&x,&y);printf("%d\n",query(1,x,y));}}return 0;}
0 0
- hdoj The Water Problem 5443 (线段树区间最值问题)
- HDOJ 5443 The Water Problem(线段树区间最值)(长春网络赛)
- hdu 5443 The Water Problem(RMQ区间最值)
- The Water Problem hdoj 5443 (排序)
- HDU 5443The Water Problem 线段树
- 【线段树】HDU 5443 The Water Problem
- hduoj 5443 The Water Problem【线段树】
- hdu5443 The Water Problem(线段树)
- HDU5443 - The Water Problem (线段树)
- hdu 5443 The Water Problem(求区间最值+ST表)
- qduoj water problem(线段树区间查询)
- hdoj 5443 The Water Problem 【RMQ】
- hdu-5443-The Water Problem -裸的RMQ线段树
- HDU 5443 The Water Problem(线段树水题)
- HDOJ5443 The Water Problem(线段树)
- 线段树+RMQ区间最值问题
- hdoj I Hate It 1754 (线段树区间最值 模板)
- HDU 5443 The Water Problem(RMQ 求区间最大值)
- 认识与入门 Markdown
- V4L2简介
- python学习--模块
- Java拷文件4种方法及效率实验
- 表单新增加的很很用的属性
- hdoj The Water Problem 5443 (线段树区间最值问题)
- Base64编码原理
- Gson 源码解析-2015/10/13
- 黑马程序员---多线程
- Django i18n国际化
- 解决JavaOpenCV的内存问题
- 广州供电局车辆管理系统
- Struts2文件上传的过滤
- 基于Ogre的DeferredShading(延迟渲染)的实现以及应用