POJ 3264 Balanced Lineup RMQ
来源:互联网 发布:linux $$ 编辑:程序博客网 时间:2024/06/05 09:12
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
范围最小值问题(Range Minimum Query,RMQ)。给一个 n 个元素的数组A1,A2,...,An,查询范围(L,R)
中的最小值和最大值。
下面这篇大牛的文章详细介绍了RMQ
RMQ详解
Sparse-Table算法,dp初始化,时间O(nlogn),查询只需O(1)。
令 d(i, j) 表示从 i 开始,长度为 2^j 的一段元素的最小值,则状态转移:
d( i , j ) = min{ d( i , j - 1 ), d(i + 2^( j - 1) , j - 1 )},原理如下图:
注意2^j <= n,因此 d 数组的元素个数不超过 nlogn ,而每一项都可以在常数时间计算完毕,故总时间为O(nlogn)。
查询时,令 k 为满足 2^k <= R - L + 1 的最大整数,则以 L 开头,以 R 结尾的两个长度为2^k 的区间合起来即覆盖了查询区间[L , R]。
代码:
#include <cstdio>#include <vector>#include <iostream>using namespace std;const int MAXN = 50000 + 10;int num[MAXN], mind[MAXN][16], maxd[MAXN][16]; //2^16 > MAXNint N, M;vector<int> V;//预处理,时间复杂度:O(nlogn)void RMQ_init(const vector<int>& A){ int n = A.size(); for (int i = 0; i < n; i++) mind[i][0] = maxd[i][0] = A[i]; //初始化 for (int j = 1; (1 << j) <= n; j++) //状态转移 { for (int i = 0; i + (1 << j) - 1 <= n; i++) { mind[i][j] = min(mind[i][j - 1], mind[i + (1 << (j - 1))][j - 1]); maxd[i][j] = max(maxd[i][j - 1], maxd[i + (1 << (j - 1))][j - 1]); } }}//查询int RMQ(int L, int R, int book){ int k = 0; while ((1 << (k + 1)) <= R - L + 1) k++; return book == 0 ? min(mind[L][k], mind[R - (1 << k) + 1][k]) : max(maxd[L][k], maxd[R - (1 << k) + 1][k]);}int main(){ scanf("%d%d", &N, &M); int x; for (int i = 0; i < N; i++) { scanf("%d", &x); V.push_back(x); } RMQ_init(V); while (M--) { int L, R; scanf("%d%d", &L, &R); //查询时下标从1开始,故减一 printf("%d\n", RMQ(L - 1, R - 1, 1) - RMQ(L - 1, R - 1, 0)); } 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
- redis实例操作
- Java Web开发详解:RequestDispatcher接口
- REST风格
- No Datastore Session bound to thread, and configuration does not allow creation of non-transactional
- Hive学习二
- POJ 3264 Balanced Lineup RMQ
- [从头学数学] 第184节 周游列国拜诸侯(中)
- C#引用传递
- HDU 5666 快速就乘
- 用pipe唤醒异步select的经典场景
- __NSCFNumber isEqualToString:的问题.--[__NSCFNumber isEqualToString:]: unrecognized selector sent to in
- vs下,GBK格式的.h .cpp 编译时,自动转换为UTF-8
- Java学习-11天
- 剑指offer面试题 顺时针打印矩阵