hdu 5443 裸st表
来源:互联网 发布:淘宝客 2016 qq空间 编辑:程序博客网 时间:2024/06/05 07:30
题目:
http://acm.hdu.edu.cn/showproblem.php?pid=5443
The Water Problem
Time Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1862 Accepted Submission(s): 1475
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
3110011 151 2 3 4 551 21 32 43 43 531 999999 141 11 22 33 3
Sample Output
1002344519999999999991
代码:
#include<iostream>#include<cstring>#include<cstdio>#include<cstdlib>#include<ctype.h> //tower()#include<set> #include<map> #include<iomanip>// cout<<setprecision(1)<<fixed<<a;#include<vector> #include<time.h> #include<assert.h> //assert#include<cmath>#include<algorithm>#include<bitset>#include<limits.h>#include<stack>#include<queue>using namespace std;const int maxn=1010;const int inf=INT_MAX;int t,n,q,a[maxn],sti[maxn][16];void initrmq(){//记录最大值for(int i=0;i<n;++i) sti[i][0]=a[i];for(int j=1;(1<<j)<=n;++j){for(int i=0;i+(1<<j)-1<n;++i){sti[i][j]=max(sti[i][j-1],sti[i+(1<<(j-1))][j-1]);}}}int rmq(int u,int v){int k=(int)(log(v-u+1.0)/log(2.0));return max(sti[u][k],sti[v-(1<<k)+1][k]);}int main(){// hdu 5443 0MS1644Kint c,d;scanf("%d",&t);while(t--){scanf("%d",&n);for(int i=0;i<n;++i){scanf("%d",&a[i]);}initrmq();scanf("%d",&q);while(q--){scanf("%d%d",&c,&d);printf("%d\n",rmq(c-1,d-1));}}return 0;}
0 0
- hdu 5443 裸st表
- HDU 5875 二分+st表
- hdu 5443 ST表 简单求最大最小值
- HDU 5443 The Water Problem(ST)
- hdu 3183 A Magic Lamp(ST表)
- hdu 5726 GCD (二分+ST表)★
- hdu 5289 ST表+尺取法
- HDU 5726 GCD (ST 表 +查询)
- hdu 5443 The Water Problem(求区间最值+ST表)
- hdu Octorber 21st
- HDU 5875 RMQ-ST
- ST表
- st表
- st表
- st表
- ST表
- st表
- ST表
- 对象分配、布局和访问
- Mybatis mapper.xml 中的resultMap用法
- 正则表达式简介及在C++11中的简单使用
- Tensorflow学习记录9--alexnet网络
- 【React全家桶入门之六】渲染用户列表
- hdu 5443 裸st表
- Spring在使用后置通知与环绕通知时遇到的问题
- Spark常用函数讲解之键值RDD转换
- 机器学习十大算法之-CART分类决策树、回归树和模型树
- 'range' object doesn't support item deletion
- 读书笔记(五)
- C++面试之GetMemory问题
- MyBatis--初级
- 关于java注释,修饰--方法