POJ 3264 (RMQ_ST)

最新推荐文章于 2019-07-23 14:55:43 发布

mad_lpx

最新推荐文章于 2019-07-23 14:55:43 发布

阅读量355

点赞数

分类专栏： ACM之路文章标签： integer each fun list n2 up

本文链接：https://blog.csdn.net/mad_lpx/article/details/7427173

版权

ACM之路专栏收录该内容

40 篇文章 1 订阅

订阅专栏

Balanced Lineup

Time Limit: 5000MS		Memory Limit: 65536K
Total Submissions: 21590		Accepted: 10037
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.

好吧，露馅了，这是道模板题

//POJ 3264

#include<stdio.h>
#include<iostream>
#include<math.h>
#include<string.h>

using namespace std;

#define clear(a,b) memset(a,b,sizeof(a))
#define MAXN 50100
#define mmax(a,b) ((a)>(b)?(a):(b))
#define mmin(a,b) ((a)>(b)?(b):(a))

int num[MAXN];
int f1[MAXN][100], //max
    f2[MAXN][100]; //min

//spatse table

void st(int n)
{
    int i,j,k,m;
    k = (int)(log((double)n)/log(2.0));
    for(i = 1;i <= n;i++) {
      f1[i][0] = num[i];
      f2[i][0] = num[i];
      }
    for(j = 1;j <= k;j++) {
      for(i = 1;i+(1<<j)-1 <= n;i++) {
        m = i + (1<<(j-1));
        f1[i][j] = mmax(f1[i][j-1],f1[m][j-1]);
        f2[i][j] = mmin(f2[i][j-1],f2[m][j-1]);
        }
      }
}

int rmq_min(int i,int j)
{
   int k = (int)(log((double)(j-i+1))/log(2.0));
   return mmin(f2[i][k],f2[j-(1<<k)+1][k]);
}

int rmq_max(int i,int j)
{
   int k = (int)(log((double)(j-i+1))/log(2.0));
   return mmax(f1[i][k],f1[j-(1<<k)+1][k]);
}

int work()
{
    int n,q,i,a,b;
    clear(num,0);
    clear(f1,0);
    clear(f2,0);
    scanf("%d%d",&n,&q);
    for(i = 1;i <= n;i++) scanf("%d",&num[i]);
    st(n);
    for(i = 1;i <= q;i++) {
      scanf("%d%d",&a,&b);
      printf("%d\n",rmq_max(a,b) - rmq_min(a,b));
      }
}

int main()
{
    work();
    return 0;
}