zoukankan      html  css  js  c++  java
  • BZOJ1636: [Usaco2007 Jan]Balanced Lineup

    1636: [Usaco2007 Jan]Balanced Lineup

    Time Limit: 5 Sec  Memory Limit: 64 MB
    Submit: 476  Solved: 345
    [Submit][Status]

    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

    6 3 1 7 3 4 2 5 1 5 4 6 2 2

    Sample Input

    * 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 Output


    6
    3
    0

    HINT

     

    Source

    题解:
    裸RMQ,英语渣哭了QAQ....
    代码:
     1 #include<cstdio>
     2 #include<cmath>
     3 #include<cstring>
     4 #include<algorithm>
     5 #include<iostream>
     6 #define maxn 50000+100
     7 #define maxm 100000
     8 using namespace std;
     9 int n,m,a[maxn],f[maxn][16],g[maxn][16];
    10 inline int read()
    11 {
    12     int x=0,f=1;char ch=getchar();
    13     while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    14     while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    15     return x*f;
    16 }
    17 void rmq()
    18 {
    19     for(int i=1;i<=n;i++)f[i][0]=a[i];
    20     for(int i=1;i<=floor(log(n)/log(2));i++)
    21      for(int j=1;j<=n-(1<<i)+1;j++)
    22       f[j][i]=max(f[j][i-1],f[j+(1<<(i-1))][i-1]);
    23     for(int i=1;i<=n;i++)g[i][0]=a[i];
    24     for(int i=1;i<=floor(log(n)/log(2));i++)
    25      for(int j=1;j<=n-(1<<i)+1;j++)
    26       g[j][i]=min(g[j][i-1],g[j+(1<<(i-1))][i-1]);  
    27 }
    28 int query(int x,int y)
    29 {
    30     int z=floor(log(y-x+1)/log(2));
    31     return max(f[x][z],f[y-(1<<z)+1][z])-min(g[x][z],g[y-(1<<z)+1][z]);
    32 }
    33 int main()
    34 {
    35     freopen("input.txt","r",stdin);
    36     freopen("output.txt","w",stdout);
    37     n=read();m=read();
    38     for(int i=1;i<=n;i++)a[i]=read();
    39     rmq();
    40     while(m--)
    41     {
    42         int x=read(),y=read();
    43         printf("%d
    ",query(x,y));
    44     }
    45     return 0;
    46 }
    View Code
  • 相关阅读:
    ELK 安装与配置
    redis参数与持久化原理
    python_way ,day26 django_admin 自定义
    python_way ,day25 wmi
    docker系列详解<一>之docker安装
    SpringCloud学习系列<一>版本介绍
    docker 安装MongoDB以及设置用户
    Caused by: java.lang.IllegalArgumentException
    tomcat启动时间5分钟左右org.apache.catalina.util.SessionIdGeneratorBase.createSecureRandom Creation of SecureRandom instance for session ID generation using [SHA1PRNG] took [342,445] milliseconds.
    Spring 全局异常拦截根据业务返回不同格式数据 自定义异常
  • 原文地址:https://www.cnblogs.com/zyfzyf/p/3925322.html
Copyright © 2011-2022 走看看