zoukankan      html  css  js  c++  java
  • 【poj3264】Balanced Lineup

    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

    Source

    题解

    给定一个区间,求最大值与最小值之差

    ST表

    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #define N 50010
    using namespace std;
    int ff[1<<20];
    int a[N],rmq[20][N],rmx[20][N];
    int n,m;
    void rmq_init()
    {
        for (int i=1;i<=n;i++)
        {
            rmq[0][i] = a[i];
            rmx[0][i] = a[i];
        }
        for (int j=1;j<20;j++)
            for (int i=1;i+(1<<j)-1<=n;i++){
                rmq[j][i] = min(rmq[j-1][i],rmq[j-1][i+(1<<j>>1)]);
                rmx[j][i] = max(rmx[j-1][i],rmx[j-1][i+(1<<j>>1)]);
            }
        memset(ff,-1,sizeof(ff));
        for (int i=0;i<20;i++)    ff[1<<i] = i;
        for (int i=0;i<N;i++)
            if (ff[i] == -1)
                ff[i] = ff[i-1];
    }
    pair<int,int> rmq_find(int x,int y)
    {
        int t=ff[y-x+1];
        return make_pair(min(rmq[t][x],rmq[t][y-(1<<t)+1]),
                         max(rmx[t][x],rmx[t][y-(1<<t)+1]));
    }
    int main()
    {
        int l,r;
        scanf("%d%d",&n,&m);
        for (int i=1;i<=n;i++) scanf("%d",&a[i]);
        rmq_init();
        for (int i=1;i<=m;i++)
        {
            scanf("%d%d",&l,&r);
            printf("%d
    ",rmq_find(l,r).second-rmq_find(l,r).first);
        }
    }
  • 相关阅读:
    AD用户移除所属组
    Mysql中文乱码问题完美解决方案
    将sqllite3数据库迁移到mysql
    检查远端服务器端口是否打开
    远程桌面卡
    不同平台的线程并发接口对比
    stm32之中断配置
    stm32之CMSIS标准、库目录、GPIO
    stm32 中断几个库函数实现过程分析
    Tree命令使用
  • 原文地址:https://www.cnblogs.com/liumengyue/p/5467713.html
Copyright © 2011-2022 走看看