pku 3264 Balanced Lineup(线段树)
来源:互联网 发布:linux gem命令 编辑:程序博客网 时间:2024/06/05 08:59
Balanced Lineup
Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 27660 Accepted: 13008Case 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.
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 31734251 54 62 2
Sample Output
630
Source
USACO 2007 January Silver
题意:求一个区间上最大和最小值的差
题解:用2棵线段树,一个存最大值,一个存最小值,仅需作查询操作
#include<stdio.h>#include<string.h>int n,m,a[200500],c1[200500],c2[200500];int MAX(int a,int b){ if(a>b) return a; return b;}int MIN(int a,int b){ if(a<b) return a; return b;}void init1(int l,int r,int pos){ int mid=(l+r)/2; if(l==r){ c1[pos]=a[l]; return; } init1(l,mid,2*pos),init1(mid+1,r,2*pos+1); c1[pos]=MAX(c1[2*pos],c1[2*pos+1]);}void init2(int l,int r,int pos){ int mid=(l+r)/2; if(l==r){ c2[pos]=a[l]; return; } init2(l,mid,2*pos),init2(mid+1,r,2*pos+1); c2[pos]=MIN(c2[2*pos],c2[2*pos+1]);}int ques1(int l,int r,int pos,int templ,int tempr){ int mid=(l+r)/2; if(templ<=l&&r<=tempr) return c1[pos]; else if(templ>mid) return ques1(mid+1,r,2*pos+1,templ,tempr); else if(tempr<=mid) return ques1(l,mid,2*pos,templ,tempr); return MAX(ques1(l,mid,2*pos,templ,mid),ques1(mid+1,r,2*pos+1,mid+1,tempr));}int ques2(int l,int r,int pos,int templ,int tempr){ int mid=(l+r)/2; if(templ<=l&&r<=tempr) return c2[pos]; else if(templ>mid) return ques2(mid+1,r,2*pos+1,templ,tempr); else if(tempr<=mid) return ques2(l,mid,2*pos,templ,tempr); return MIN(ques2(l,mid,2*pos,templ,mid),ques2(mid+1,r,2*pos+1,mid+1,tempr));}int main(){ int i,x,y; while(scanf("%d%d",&n,&m)>0) { for(i=1;i<=n;i++) scanf("%d",a+i); init1(1,n,1),init2(1,n,1); for(i=0;i<m;i++) { scanf("%d%d",&x,&y); printf("%d\n",ques1(1,n,1,x,y)-ques2(1,n,1,x,y)); } } return 0;}
- pku 3264 Balanced Lineup(线段树)
- pku 3264 Balanced Lineup(线段树)
- pku 3264 Balanced Lineup线段树
- 线段树:Balanced Lineup(pku 3264)(解题报告)
- PKU-3264 Balanced Lineup (RMQ之线段树)
- pku 3264 Balanced Lineup ( rmq or 线段树 )
- pku 3264Balanced Lineup
- Pku 3264 Balanced Lineup
- POJ 3264 - Balanced Lineup(线段树)
- Balanced Lineup(POJ-3264)(线段树)
- POJ - 3264 - Balanced Lineup (线段树)
- poj 3264 Balanced Lineup(线段树)
- POJ 3264Balanced Lineup(线段树)
- poj 3264 Balanced Lineup(线段树)
- POJ 3264Balanced Lineup (线段树)
- 3264 Balanced Lineup 线段树
- Balanced Lineup(线段树)
- Pku oj 3264 Balanced Lineup(RMQ)
- Android自定义控件实现环形播放进度条
- 图像处理常用算法(C/C++)
- Android自定义进度条颜色
- OPencv把图像二值化后在绘制轮廓
- Android自定义属性的学习
- pku 3264 Balanced Lineup(线段树)
- 一个一直忽略的问题
- Tooth And Claw——Sredni Vashtar
- 求中位数!面试题
- mvc 详解Controller之Filter
- awk命令统计访问量
- Oracle Partition 分区详细总结
- 记录nginx两种问题解决
- 情感分析(Sentiment Analysis)的难题