Balanced Lineup(RMQ)
来源:互联网 发布:苏州叫车软件 编辑:程序博客网 时间:2024/06/05 11:55
Balanced Lineup
Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 38466 Accepted: 18029Case Time Limit: 2000MS
Description
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.
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 31734251 54 62 2
Sample Output
630
Source
USACO 2007 January Silver
#include<cstdio>#include<cmath>#include<iostream>#include<algorithm>const int N=50010;using namespace std;int max_num[N][20],min_num[N][20];void RMQ(int n) //预处理->O(nlogn){ for(int j = 1; j < 20; ++j) for(int i = 1; i <= n; ++i) if(i + (1 << j) - 1 <= n) { max_num[i][j] = max(max_num[i][j - 1], max_num[i + (1 << (j - 1))][j - 1]); min_num[i][j] = min(min_num[i][j - 1], min_num[i + (1 << (j - 1))][j - 1]); }}int Query(int a,int b){ int maxs,mins; int k = (int)(log(b - a + 1.0) / log(2.0)); maxs=max(max_num[a][k],max_num[b-(1<<k)+1][k]); mins=min(min_num[a][k],min_num[b-(1<<k)+1][k]); return maxs-mins;}int main(){ int n,m,i,a,b; while(cin>>n>>m) { for(i=1;i<=n;i++) { scanf("%d",&max_num[i][0]); min_num[i][0]=max_num[i][0]; } RMQ(n); while(m--) { scanf("%d%d",&a,&b); printf("%d\n",Query(a,b)); } }}
0 0
- Balanced Lineup(RMQ)
- Balanced Lineup(RMQ)
- Balanced Lineup(RMQ)
- POJ3264 Balanced Lineup(RMQ)
- poj_3264 Balanced Lineup(RMQ)
- poj 3264 Balanced Lineup (RMQ))
- poj 3264 Balanced Lineup(RMQ)
- POJ 3264 Balanced Lineup(简单RMQ)
- Balanced Lineup(RMQ)(POJ 3264)
- POJ 3264--Balanced Lineup(RMQ问题)
- POJ 3264 Balanced Lineup(RMQ详解)
- POJ 3264 Balanced Lineup(RMQ模板)
- POJ 题目3264 Balanced Lineup(RMQ)
- poj 3264 Balanced Lineup(RMQ)
- POJ 3264 Balanced Lineup(RMQ)
- poj 3264 Balanced Lineup(RMQ)
- poj3264 Balanced Lineup(RMQ裸题)
- POJ 3264 Balanced Lineup(RMQ)
- 快速查找素数
- Jetty 的工作原理以及与 Tomcat 的比较
- CentOS搭建LAMP服务器环境硬盘分区方案分享
- Android使用Linux mount获取SdCard存储目录
- [LeetCode][Java] Search Insert Position
- Balanced Lineup(RMQ)
- redhat7 systemctl的使用
- 消息推送原理
- 密码发生器
- iOS设计模式-原型
- 线段树扫描线算法
- C++矩阵处理库(比LAPACK更方便)——Eigen详细解析
- Mybatis框架实现功能的流程
- 【C++11】新特性——引入nullprt