Balanced Lineup(线段树-树状数组)
来源:互联网 发布:c语言中n的阶乘 编辑:程序博客网 时间:2024/05/21 01:55
点击打开链接
Balanced Lineup
Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 55919 Accepted: 26205Case 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
Select Code
#include<iostream>using namespace std;const int INF = 0xffffff0;int minV = INF;int maxV = -INF;struct Node//不要左右子节点指针的做法 {int L,R;int minV,maxV;int Mid(){return (L+R)/2;}};Node tree[800010];//4倍叶子节点数量就够 void BuildTree(int root, int L, int R){tree[root].L = L;tree[root].R = R;tree[root].minV = INF;tree[root].maxV = -INF;if(L!=R){BuildTree(2*root+1, L, (L+R)/2);BuildTree(2*root+2, (L+R)/2+1, R);}}void Insert(int root, int i, int v)//将第i个数,其值为v,插入线段树 {if(tree[root].L == tree[root].R)//成立则亦有tree[root].R==i {tree[root].minV = tree[root].maxV = v;return ;}tree[root].minV = min(tree[root].minV , v);//终于找到bug了 tree[root].maxV = max(tree[root].maxV , v);if(i <= tree[root].Mid())Insert(2*root + 1, i, v);elseInsert(2*root + 2, i, v);}void Query(int root, int s, int e)//查询区间[s,e]中的最大值和最小值,如果更优就记录在全局变量里 {if( tree[root].minV >= minV && tree[root].maxV <= maxV )return;if( tree[root].L == s && tree[root].R == e ){minV = min( minV, tree[root].minV );//minV = min( minV, tree[root].minV );maxV = max( maxV, tree[root].maxV );return ;}if( e <= tree[root].Mid() )Query( 2*root + 1, s, e );else if( s > tree[root].Mid() )Query( 2*root + 2, s, e );else{Query( 2*root + 1, s, tree[root].Mid() );Query( 2*root + 2, tree[root].Mid() + 1, e );}}int main(){int n,q,h;int i,j,k;scanf("%d%d",&n,&q);BuildTree(0, 1, n);for(i=1; i<=n; i++){scanf("%d",&h);Insert(0, i, h);}for(i=0; i<q; i++){int s,e;scanf("%d%d",&s,&e);minV=INF;maxV=-INF;Query(0, s, e);printf("%d\n",maxV-minV);}return 0;}
阅读全文
0 0
- Balanced Lineup(线段树-树状数组)
- Balanced Lineup(poj3264线段树或树状数组)
- Balanced Lineup(树状数组 POJ3264)
- Balanced Lineup(线段树)
- 线段树 Balanced Lineup
- Balanced Lineup (基本线段树)
- Balanced Lineup poj3264 线段树
- 3264 Balanced Lineup 线段树
- poj3264,Balanced Lineup,线段树
- poj3264 Balanced Lineup(线段树)
- poj3264 Balanced Lineup(线段树)
- POJ3264 Balanced Lineup(线段树)
- Balanced Lineup(线段树)
- POJ3264 Balanced Lineup 【线段树】
- Balanced Lineup 线段树 RMQ
- pku 3264 Balanced Lineup(线段树)
- poj 3264 Balanced Lineup rmq/线段树
- pku 3264 Balanced Lineup线段树
- POJ 1976-动态规划
- 蓝牙
- JavaWeb复习小知识点(一)
- linux安装scrapy出错'x86_64-Linux-gnu-gcc' failed with exit status 1
- Ice系列--Ice Registry(1)
- Balanced Lineup(线段树-树状数组)
- HAWQ + MADlib 玩转数据挖掘之(十)——图算法之单源最短路径
- Python 多进程
- UnsupportedClassVersionError 解决办法
- 数组与其内存分配情况
- 安卓系统之旅——最全的Android源码目录结构
- 智能小车十一《完成小车电路板设计》
- LeetCode 202. Happy Number
- javascript------Bootstrap框架