HDU 5443 The Water Problem(线段树水题)
来源:互联网 发布:js div隐藏与显示出来 编辑:程序博客网 时间:2024/05/18 16:37
The Water Problem
Time Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 160 Accepted Submission(s): 130
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
Source
2015 ACM/ICPC Asia Regional Changchun Online
#include <iostream>#include <cstdio>#include <string.h>#include <string>#include <cstdlib>#include <algorithm>using namespace std;const int N=1000*4;struct Node{int l,r,big;}node[N];void Init(int now,int le,int ri){if(le==ri){scanf("%d",&node[now].big);node[now].l=le;node[now].r=ri;//printf("%d %d %d %d\n",now,node[now].l,node[now].r,node[now].big);return;}int mid=(le+ri)>>1;int ne=now<<1;node[now].l=le;node[now].r=ri;Init(ne,le,mid);Init(ne+1,mid+1,ri);node[now].big=max(node[ne].big,node[ne+1].big);//printf("%d %d %d %d\n",now,node[now].l,node[now].r,node[now].big);}int find(int now,int a,int b){int mid=(node[now].l+node[now].r)>>1;int ne=now<<1;if(a==node[now].l&&b==node[now].r)return node[now].big; else if(b<=mid) return find(ne,a,b); else if(a>mid) return find(ne+1,a,b); else return max(find(ne,a,mid),find(ne+1,mid+1,b));}int main(){int t,n,i,j,a,b;scanf("%d",&t);while(t--){scanf("%d",&n);Init(1,1,n);scanf("%d",&i);while(i--){scanf("%d%d",&a,&b);printf("%d\n",find(1,a,b));}}return 0;}
0 0
- HDU 5443 The Water Problem(线段树水题)
- HDU 5443The Water Problem 线段树
- 【线段树】HDU 5443 The Water Problem
- hdu-5443-The Water Problem -裸的RMQ线段树
- 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
- hdu 5443 The Water Problem
- HDU 5443 The Water Problem
- hdu 5443 The Water Problem
- hduoj 5443 The Water Problem【线段树】
- HDU 5443 The Water Problem 签到
- hdu 5443 The Water Problem(水)
- HDU 5443 The Water Problem RMQ/暴力
- HDU 5443 The Water Problem RMQ
- HDU 5443 The Water Problem(ST)
- 网易游戏2016校招"数据挖掘研究员"在线比赛题一求解算法(C++)
- OnMouseMove中的nFlags的意义何在呢?检测当前我们说产生的动作是如何
- 5、编程珠玑笔记五编程小事
- JAVA中的访问控制级别
- 第5章 泛型
- HDU 5443 The Water Problem(线段树水题)
- 【bzoj1483】【hnoi2009】【梦幻布丁】【链表+启发式合并】
- 学习各种各样知识的手册网站大全
- 学习窗框和画布上绘画
- bzoj-1131 Sta
- JAVA程序
- 读研的困惑
- HTML
- 济宁游