poj 3264 balanced lineup
来源:互联网 发布:mac深圳 编辑:程序博客网 时间:2024/05/20 06:08
Balanced Lineup
Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 42075 Accepted: 19769Case 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<iostream>#include<cstdio>#include<cstring>#include<cmath>using namespace std;int maxn[50003][20],minn[50003][20],len[50003];int i,j,n,m;int main(){ scanf("%d%d",&n,&m); for (i=1;i<=n;i++) scanf("%d",&len[i]); for (i=1;i<=n;i++) maxn[i][0]=len[i],minn[i][0]=len[i]; for (j=1;j<=20;j++) for (i=1;i<=n;i++) if (i+(1<<j)-1<=n) { maxn[i][j]=max(maxn[i][j-1],maxn[i+(1<<(j-1))][j-1]); minn[i][j]=min(minn[i][j-1],minn[i+(1<<(j-1))][j-1]); } for (i=1;i<=m;i++) { int x,y; scanf("%d%d",&x,&y); int k=0; while ((1<<(k+1))<=y-x+1) k++; int t=max(maxn[x][k],maxn[y-(1<<k)+1][k])-min(minn[x][k],minn[y-(1<<k)+1][k]); printf("%d\n",t); } return 0;}RMQ算法模板题
0 0
- POJ 3264 Balanced Lineup
- POJ 3264 Balanced Lineup
- poj 3264 Balanced Lineup
- poj 3264 Balanced Lineup
- poj 3264 Balanced Lineup
- poj 3264 Balanced Lineup
- Poj 3264 Balanced Lineup
- poj 3264 Balanced Lineup
- POJ-3264-Balanced Lineup
- poj 3264 Balanced Lineup
- poj 3264 Balanced Lineup
- POJ 3264-Balanced Lineup
- poj 3264 Balanced Lineup
- POJ 3264 Balanced Lineup
- POJ-3264-Balanced Lineup
- POJ 3264 Balanced Lineup
- POJ 3264 Balanced Lineup
- poj 3264 Balanced Lineup
- 257. Binary Tree Paths
- 为什么串口大9初始化会报错?
- markdown tips记录
- NDK单步调试
- DISPO与EKGRP 的关系(MRP控制者和采购组)
- poj 3264 balanced lineup
- 产品经理常用的那些图
- uva11464 - Age Sort
- pthread condition mutex
- Java中file类getPath(),getAbsolutePath(),getCanonicalPath()方法区别
- IPC(Inner Process Comunication)机制基本了解
- 从头认识Spring-1.14 SpEl表达式(1)-简介与嵌入值
- java中split()特殊符号"." "|" "*" "\" "]"
- pig安装和配置 详细教程