BZOJ 1636: [Usaco2007 Jan]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.

题目大意:

给出一段长度为n(1 <= N <= 50,000)的数列,每个数字a(1 <= a<= 1,000,000),q(1 <= Q <= 200,000) 个询问,询问[l,r]之间的“最大值-最小值”。

第一行为n和q,第二行n个数表示ai,接下来q行行一对l,r。

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

题解

线段树水题。

#include<cstdio> 
#include<cstring> 
#include<iostream> 
#include<algorithm> 
#include<cstdlib> 
#include<cmath> 
using namespace std; 
int n,m,a[50002]; 
struct shu {int l,r,mx,mn;} tr[200002]; 
void build(int w,int b,int e) 
{ 
    tr[w].l=b; tr[w].r=e; 
    if(b==e) {tr[w].mx=tr[w].mn=a[b]; return;} 
    int mid=(b+e)>>1; 
    build(w<<1,b,mid); build((w<<1)+1,mid+1,e); 
    tr[w].mx=max(tr[w<<1].mx,tr[(w<<1)+1].mx); 
    tr[w].mn=min(tr[w<<1].mn,tr[(w<<1)+1].mn); 
} 
int askmx(int w,int b,int e) 
{ 
    int l=tr[w].l,r=tr[w].r,mid; 
    if(l==b&&r==e) return tr[w].mx; 
    mid=(l+r)>>1; 
    if(mid>=e) return askmx(w<<1,b,e); 
    else if(mid<b) return askmx((w<<1)+1,b,e); 
    else return max(askmx(w<<1,b,mid),askmx((w<<1)+1,mid+1,e)); 
} 
int askmn(int w,int b,int e) 
{ 
    int l=tr[w].l,r=tr[w].r,mid; 
    if(l==b&&r==e) return tr[w].mn; 
    mid=(l+r)>>1; 
    if(mid>=e) return askmn(w<<1,b,e); 
    else if(mid<b) return askmn((w<<1)+1,b,e); 
    else return min(askmn(w<<1,b,mid),askmn((w<<1)+1,mid+1,e)); 
} 
int main() 
{ 
    scanf("%d%d",&n,&m); 
    int i,x,y; 
    for(i=1;i<=n;i++) scanf("%d",&a[i]); 
    build(1,1,n); 
    for(i=1;i<=m;i++) 
       {scanf("%d%d",&x,&y); 
        printf("%d\n",askmx(1,x,y)-askmn(1,x,y)); 
       } 
    return 0; 
}
相关推荐
<p> 欢迎参加英特尔® OpenVINO™工具套件初级课程 !本课程面向零基础学员,将从AI的基本概念开始,介绍人工智能与视觉应用的相关知识,并且帮助您快速理解英特尔® OpenVINO™工具套件的基本概念以及应用场景。整个课程包含了视频的处理,深度学习的相关知识,人工智能应用的推理加速,以及英特尔® OpenVINO™工具套件的Demo演示。通过本课程的学习,将帮助您快速上手计算机视觉的基本知识和英特尔® OpenVINO™ 工具套件的相关概念。 </p> <p> 为保证您顺利收听课程参与测试获取证书,还请您于<strong>电脑端</strong>进行课程收听学习! </p> <p> 为了便于您更好的学习本次课程,推荐您免费<strong>下载英特尔® OpenVINO™工具套件</strong>,下载地址:https://t.csdnimg.cn/yOf5 </p> <p> 收听课程并完成章节测试,可获得本课程<strong>专属定制证书</strong>,还可参与<strong>福利抽奖</strong>,活动详情:https://bss.csdn.net/m/topic/intel_openvino </p> <p> 8月1日-9月30日,学习完成【初级课程】的小伙伴,可以<span style="color:#FF0000;"><strong>免费学习【中级课程】</strong></span>,中级课程免费学习优惠券将在学完初级课程后的7个工作日内发送至您的账户,您可以在:<a href="https://i.csdn.net/#/wallet/coupon">https://i.csdn.net/#/wallet/coupon</a>查询优惠券情况,请大家报名初级课程后尽快学习哦~ </p> <p> <span style="font-size:12px;">请注意:点击报名即表示您确认您已年满18周岁,并且同意CSDN基于商务需求收集并使用您的个人信息,用于注册OpenVINO™工具套件及其课程。CSDN和英特尔会为您定制最新的科学技术和行业信息,将通过邮件或者短信的形式推送给您,您也可以随时取消订阅不再从CSDN或Intel接收此类信息。 查看更多详细信息请点击CSDN“<a href="https://passport.csdn.net/service">用户服务协议</a>”,英特尔“<a href="https://www.intel.cn/content/www/cn/zh/privacy/intel-privacy-notice.html?_ga=2.83783126.1562103805.1560759984-1414337906.1552367839&elq_cid=1761146&erpm_id=7141654/privacy/us/en/">隐私声明</a>”和“<a href="https://www.intel.cn/content/www/cn/zh/legal/terms-of-use.html?_ga=2.84823001.1188745750.1560759986-1414337906.1552367839&elq_cid=1761146&erpm_id=7141654/privacy/us/en/">使用条款</a>”。</span> </p> <p> <br /> </p>
©️2020 CSDN 皮肤主题: 大白 设计师:CSDN官方博客 返回首页