[POJ]
来源:互联网 发布:网络诈骗5000元判缓刑 编辑:程序博客网 时间:2024/06/01 09:57
For the daily milking, Farmer John’s N cows (1 ≤ N ≤ 50,000) always line up in the same order. One day Farmer John decides to organize a game of Ultimate Frisbee with some of the cows. To keep things simple, he will take a contiguous range of cows from the milking lineup to play the game. However, for all the cows to have fun they should not differ too much in height.
Farmer John has made a list of Q (1 ≤ Q ≤ 200,000) potential groups of cows and their heights (1 ≤ height ≤ 1,000,000). For each group, he wants your help to determine the difference in height between the shortest and the tallest cow in the group.
Input
Line 1: Two space-separated integers, N and Q.
Lines 2.. N+1: Line i+1 contains a single integer that is the height of cow i
Lines N+2.. N+ Q+1: Two integers A and B (1 ≤ A ≤ B ≤ N), representing the range of cows from A to B inclusive.
Output
Lines 1.. Q: Each line contains a single integer that is a response to a reply and indicates the difference in height between the tallest and shortest cow in the range.
Sample Input
6 3
1
7
3
4
2
5
1 5
4 6
2 2
Sample Output
6
3
0
题解
这是ST算法,可以对比一下线段树的写法
http://blog.csdn.net/ctsas/article/details/64955421
#include<cstdio>#include<cmath>#include<algorithm>#define MAX_N 50005#define INF 0x3f3f3f3fusing namespace std;int maxsum[MAX_N][19],minsum[MAX_N][19];void RMQ(int n){ for(int j=1;j<19;j++) for(int i=0;i+(1<<j)<=n;i++){ maxsum[i][j]=max(maxsum[i][j-1],maxsum[i+(1<<j-1)][j-1]); minsum[i][j]=min(minsum[i][j-1],minsum[i+(1<<j-1)][j-1]); }}int query(int l,int r){ int k=log(r-l+1.0)/log(2.0); return max(maxsum[l][k],maxsum[r-(1<<k)+1][k])-min(minsum[l][k],minsum[r-(1<<k)+1][k]);}int main(){ int n,m; while(scanf("%d%d",&n,&m)!=EOF){ for(int i=0;i<n;i++){ scanf("%d",&maxsum[i][0]); minsum[i][0]=maxsum[i][0]; } RMQ(n); while(m--){ int l,r; scanf("%d%d",&l,&r); printf("%d\n",query(l-1,r-1)); } } return 0;}
- POJ
- poj
- POJ
- POJ
- poj
- poj
- POJ
- POJ
- poj
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- google.protobuf.message.DecodeError: Truncated message. 解决方法
- linux 环境变量设置
- ARM64 Exception vectors
- linux日常总结
- Unity 自己lu带有惯性(缓动)的代码
- [POJ]
- 剑指offer 32 统计数字出现次数
- android图形
- iOS webView “NSURLErrorDomain”错误 -999
- Onvif协议客户端开发【1.概念篇】
- YII踩坑纪录
- Ubuntu下LAMP环境的搭建以及远程连接MySQL数据库
- svn的常见错误
- Hibernate学习笔记(二)