关闭

POJ——3264Balanced Lineup(RMQ模版水题)

132人阅读 评论(0) 收藏 举报
分类:

Balanced Lineup
Time Limit: 5000MS   Memory Limit: 65536K
Total Submissions: 44112   Accepted: 20713
Case 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.

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

代码:

#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<sstream>
#include<cstring>
#include<cstdio>
#include<string>
#include<deque>
#include<stack>
#include<cmath>
#include<queue>
#include<set>
#include<map>
#define INF 0x3f3f3f3f
#define MM(x) memset(x,0,sizeof(x))
using namespace std;
typedef long long LL;
const int N=50010;
int n,q;
int maxm[N][18],minm[N][18];
void rmq()
{
	int i,j;
	for (j=1; (1<<j)<=n; j++)
	{
		for (i=1; i+(1<<j)-1<=n; i++)
		{
			minm[i][j]=min(minm[i][j-1],minm[i+(1<<(j-1))][j-1]);
			maxm[i][j]=max(maxm[i][j-1],maxm[i+(1<<(j-1))][j-1]);
		}
	}
}
int main(void)
{
	int i,j,l,r;
	while (~scanf("%d%d",&n,&q))
	{
		MM(maxm);MM(minm);
		for (i=1; i<=n; i++)
		{
			scanf("%d",&maxm[i][0]);
			minm[i][0]=maxm[i][0];
		}
		rmq();
		for (i=0; i<q; i++)
		{
			scanf("%d%d",&l,&r);
			int k=(int)log2(r-l+1);
			int ans=max(maxm[l][k],maxm[r-(1<<k)+1][k])-min(minm[l][k],minm[r-(1<<k)+1][k]);
			printf("%d\n",ans);
		}
	}
	return 0;
}

0
0
猜你在找
【套餐】Hadoop生态系统零基础入门
【套餐】嵌入式Linux C编程基础
【套餐】2017软考系统集成项目——任铄
【套餐】Android 5.x顶级视频课程——李宁
【套餐】深度学习入门视频课程——唐宇迪
【直播】广义线性模型及其应用——李科
【直播】从0到1 区块链的概念到实践
【直播】计算机视觉原理及实战——屈教授
【直播】机器学习之凸优化——马博士
【直播】机器学习&数据挖掘7周实训--韦玮
查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:39502次
    • 积分:2255
    • 等级:
    • 排名:第16626名
    • 原创:216篇
    • 转载:0篇
    • 译文:0篇
    • 评论:6条
    文章分类