HDU 5443 The Water Problem
来源:互联网 发布:navicat输入sql语句 编辑:程序博客网 时间:2024/05/20 06:24
The Water Problem
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 with a1,a2,a3,…,an representing the size of the water source. Given a set of queries each containing 2 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
3
1
100
1
1 1
5
1 2 3 4 5
5
1 2
1 3
2 4
3 4
3 5
3
1 999999 1
4
1 1
1 2
2 3
3 3
Sample Output
100
2
3
4
4
5
1
999999
999999
1
很水的一道题目,题意是找出给定范围内的最大值
AC
#include <cstdio>int main(){ int T; scanf("%d",&T); while(T--) { int n; scanf("%d",&n); long int a[n]; for(int i=0; i<n; i++) scanf("%ld",&a[i]); int q; scanf("%d",&q); int x,y; for(int i=1; i<=q; i++) { scanf("%d%d",&x,&y); long int maxn=0; if(x==y) maxn=a[x-1]; else { for(int j=x-1; j<y; j++) { if(j==x-1) maxn=a[j]; else if(a[j]>maxn) maxn=a[j]; } } printf("%ld\n",maxn); } } return 0;}
- 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
- HDU 5443 The Water Problem 签到
- HDU 5443 The Water Problem(线段树水题)
- hdu 5443 The Water Problem(水)
- HDU 5443 The Water Problem RMQ/暴力
- HDU 5443The Water Problem 线段树
- HDU 5443 The Water Problem RMQ
- 【线段树】HDU 5443 The Water Problem
- HDU 5443 The Water Problem(ST)
- HDU 5443 The Water Problem(水)
- HDU 5443 The Water Problem【RMQ水题】
- Nodejs学习路线图
- python sys.argv[]用法
- poj 2488 A Knight's Journey
- 算法的时间复杂度和空间复杂度
- 杭电ACM 1002大数相加 两种方法
- HDU 5443 The Water Problem
- 自定义View新手实战-一步步实现精美的钟表界面
- Android加载动画系列——CircularZoomLoadingAnim
- JavaScript语言中的this
- Java接口
- 全网最强Android开发/源码资源汇总,倾力打造,绝对精品!!
- [nginx源码分析]set process title
- 如何使用JS来改变CSS样式
- 数字 & 字母的研究