hduoj 5443 The Water Problem【线段树】
来源:互联网 发布:java 初始化常量 编辑:程序博客网 时间:2024/05/20 08:25
The Water Problem
Time Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1903 Accepted Submission(s): 1508
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<cstdio>#include<cstring>#include<algorithm>using namespace std;const int N = 1000 + 10;int maxn[N][30];int a[N];int num,q;void RMQ(){for(int i = 1; i <= num; i++) maxn[i][0] = a[i];for(int j = 1; (1 << j) <= num; j++) for(int i = 1; (i + (1 << j) - 1) <= num; i++){ maxn[i][j] = max(maxn[i][j-1],maxn[i+(1<<(j-1))][j-1]); }}int Query(int L, int R){int k = 0;while((1 << (k + 1)) <= R - L + 1) k++;return max(maxn[L][k],maxn[R - (1 << k) + 1][k]);}int main(){int t;scanf("%d",&t);while(t--){scanf("%d",&num);for(int i = 1; i <= num; i++) scanf("%d",&a[i]);RMQ();int l,r;scanf("%d",&q);while(q--){scanf("%d%d",&l,&r);printf("%d\n",Query(l,r));}}return 0;}
0 0
- hduoj 5443 The Water Problem【线段树】
- HDU 5443The Water Problem 线段树
- 【线段树】HDU 5443 The Water Problem
- hdu-5443-The Water Problem -裸的RMQ线段树
- HDU 5443 The Water Problem(线段树水题)
- hdu5443 The Water Problem(线段树)
- HDOJ5443 The Water Problem(线段树)
- HDU5443 - The Water Problem (线段树)
- ACM the water problem详解[C语言][线段树]
- HDOJ 5443 The Water Problem(线段树区间最值)(长春网络赛)
- hdoj The Water Problem 5443 (线段树区间最值问题)
- water problem(线段树 容易)
- qduoj water problem(线段树)
- hdu 5443 The Water Problem
- hdu 5443 The Water Problem
- HDU 5443 The Water Problem
- hdu 5443 The Water Problem
- HDU 5443 The Water Problem
- Codewars进阶之路——Fun with trees: array to tree
- NLTK在去停用词、分词、分句以及词性标注的使用
- 要开始做毕业设计了
- 在路上,看过的风景
- JAVA>>HashMap的两只遍历方式
- hduoj 5443 The Water Problem【线段树】
- Objetcs类解析
- 仅有wifi的情况下使用Raspberry pi
- 多文档 添加菜单栏 工具栏 删除ribbon
- Android基础——控件的混合生命周期
- poj1458 裸题
- 德才论 (25)
- 23.二叉搜索树的后序遍历序列
- Asp.Net MVC学习总结(三)——过滤器你怎么看?