【POJ 3264】 Balanced Lineup (RMQ)
来源:互联网 发布:生化危机6 知乎 编辑:程序博客网 时间:2024/05/16 01:51
【POJ 3264】 Balanced Lineup (RMQ)
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
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
Sample Input
6 31734251 54 62 2
Sample Output
630
Source
RMQ裸题 求区间最值差 不过好久不写RMQ还是手生了 调了好久
C++比G++快2000MS。。。不过C++函数参数的兼容……唉……CE了发
代码如下:
#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <cstdlib>using namespace std;int rqx[50005][18],rqn[50005][18];int n;void GetRMQ(){ for(int j = 1; (1<<j) < n; ++j) { for(int i = 0; i+(1<<j)-1 < n; ++i) { rqx[i][j] = max(rqx[i][j-1],rqx[i+(1<<(j-1))][j-1]); rqn[i][j] = min(rqn[i][j-1],rqn[i+(1<<(j-1))][j-1]); } }}int main(){ int q,i,j,k,mx,a,b; scanf("%d %d",&n,&q); for(i = 0; i < n; ++i) { scanf("%d",&rqx[i][0]); rqn[i][0] = rqx[i][0]; } GetRMQ(); while(q--) { scanf("%d %d",&a,&b); --a,--b; k = log10(1.0*(b-a+1))/log10(1.0*2); printf("%d\n",max(rqx[a][k],rqx[b-(1<<k)+1][k])-min(rqn[a][k],rqn[b-(1<<k)+1][k])); } return 0;}
- POJ 3264 Balanced Lineup(RMQ)
- POJ-3264 Balanced Lineup【RMQ】
- poj 3264 Balanced Lineup RMQ
- POJ 3264 Balanced Lineup [RMQ]
- 【RMQ】poj 3264 Balanced Lineup
- 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)
- 【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
- 黑马程序员_tomcat 配置数据源和连接池
- COCI CONTEST #3 29.11.2014 T5 STOGOVI
- hdu 1285 邻接表数组实现
- POJ - 1905-Expanding Rods-数论-二分&几何
- 延展、协议
- 【POJ 3264】 Balanced Lineup (RMQ)
- android学习笔记(二)—— 常用布局与控件
- hdu 1829 A Bug's Life (判断二分图)
- Axure的变量
- iOS开发之 内存管理以及深浅拷贝
- C++Primer中文版 1.5.2节练习
- 设计模式-行为型之责任链模式
- COCI CONTEST #3 29.11.2014 T6 KAMIONI
- 第二篇:OC中类的继承