poj 3264 线段树,链表实现
来源:互联网 发布:无法初始网络小引擎 编辑:程序博客网 时间:2024/05/20 05:05
Balanced Lineup
Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 48900 Accepted: 22901Case 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
ac代码
#include<iostream>
#include<cstdio>
#include<stdlib.h>
using namespace std;
const int INF=99999999;
int mi,mx;
struct node{
int l,r,minn,maxx;
node *lchild,*rchild;
};
void buildtree(node* &root,int l,int r){
root=(node*)malloc(sizeof(node));
root->l=l;
root->r=r;
root->minn=INF;
root->maxx=-INF;
if(r==l) return;
buildtree(root->lchild,l,(r+l)/2);
buildtree(root->rchild,(r+l)/2+1,r);
}
void iinsert(node *root,int i,int v){
if(root->l==root->r){
root->maxx=root->minn=v;
return;
}
root->minn=min(root->minn,v);
root->maxx=max(root->maxx,v);
if(i<=(root->l+root->r)/2)
iinsert(root->lchild,i,v);
else
iinsert(root->rchild,i,v);
}
void Query(node *root,int s,int e){
if(mi<=root->minn&&mx>=root->maxx) return ;
if(s==root->l&&e==root->r){
mi=min(root->minn,mi);
mx=max(root->maxx,mx);
return;
}
if(e<=(root->l+root->r)/2)
Query(root->lchild,s,e);
else if(s>(root->l+root->r)/2)
Query(root->rchild,s,e);
else{
Query(root->lchild,s,(root->l+root->r)/2);
Query(root->rchild,(root->l+root->r)/2+1,e);
}
}
int main(){
node* root;
int n,q,h;
cin>>n>>q;
buildtree(root,1,n);
for(int i=1;i<=n;i++){
scanf("%d",&h);
iinsert(root,i,h);
}
for(int i=1;i<=q;i++){
int s,e;
scanf("%d%d",&s,&e);
mi=INF;
mx=-INF;
Query(root,s,e);
printf("%d\n",mx-mi);
}
return 0;
}
#include<cstdio>
#include<stdlib.h>
using namespace std;
const int INF=99999999;
int mi,mx;
struct node{
int l,r,minn,maxx;
node *lchild,*rchild;
};
void buildtree(node* &root,int l,int r){
root=(node*)malloc(sizeof(node));
root->l=l;
root->r=r;
root->minn=INF;
root->maxx=-INF;
if(r==l) return;
buildtree(root->lchild,l,(r+l)/2);
buildtree(root->rchild,(r+l)/2+1,r);
}
void iinsert(node *root,int i,int v){
if(root->l==root->r){
root->maxx=root->minn=v;
return;
}
root->minn=min(root->minn,v);
root->maxx=max(root->maxx,v);
if(i<=(root->l+root->r)/2)
iinsert(root->lchild,i,v);
else
iinsert(root->rchild,i,v);
}
void Query(node *root,int s,int e){
if(mi<=root->minn&&mx>=root->maxx) return ;
if(s==root->l&&e==root->r){
mi=min(root->minn,mi);
mx=max(root->maxx,mx);
return;
}
if(e<=(root->l+root->r)/2)
Query(root->lchild,s,e);
else if(s>(root->l+root->r)/2)
Query(root->rchild,s,e);
else{
Query(root->lchild,s,(root->l+root->r)/2);
Query(root->rchild,(root->l+root->r)/2+1,e);
}
}
int main(){
node* root;
int n,q,h;
cin>>n>>q;
buildtree(root,1,n);
for(int i=1;i<=n;i++){
scanf("%d",&h);
iinsert(root,i,h);
}
for(int i=1;i<=q;i++){
int s,e;
scanf("%d%d",&s,&e);
mi=INF;
mx=-INF;
Query(root,s,e);
printf("%d\n",mx-mi);
}
return 0;
}
0 0
- poj 3264 线段树,链表实现
- POJ 3264 线段树
- poj(3264+线段树)
- POJ 3264 线段树
- POJ 3264 线段树
- POJ 3264 线段树
- poj 3264 线段树
- poj-3264-线段树
- poj 3264 Balanced Lineup RMQ线段树实现
- POJ 3264 简单线段树
- poj 3264 线段树方法
- poj 3264 ( 线段树)
- poj 3264线段树基础
- POJ 3264 线段树 ST
- poj 3264 线段树 入门
- poj 3264 & poj 3468(线段树)
- Balanced Lineup-POJ - 3264-RMQ线段树/st表
- poj 3264 Balanced Lineup rmq/线段树
- 在IOS中嵌套H5页面发生空白的问题
- MySQL数据库的函数
- python实现线性表顺序存储的插入操作
- Android Stadio 代码模板 fbc的使用
- Rviz教程-Marker:点和线(C++)
- poj 3264 线段树,链表实现
- shell脚本编程(一)
- redis 配置详解
- svn和git的区别
- ioctl那些事儿
- 网站制作完成之后,对页面进行测试,测试内容主要包括哪几个方面?
- Myeclipse SSH配置
- 网络编程学习笔记一:Socket编程
- android studio gradle编译异常小结