bzoj 1636: [Usaco2007 Jan]Balanced Lineup --…
2018-06-17 23:35:51来源:未知 阅读 ()
1636: [Usaco2007 Jan]Balanced Lineup
Time Limit: 5 Sec Memory Limit: 64 MBSubmit: 772 Solved: 560
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.
每天,农夫 John 的N(1 <= N <= 50,000)头牛总是按同一序列排队. 有一天, John 决定让一些牛们玩一场飞盘比赛. 他准备找一群在对列中为置连续的牛来进行比赛. 但是为了避免水平悬殊,牛的身高不应该相差太大. John 准备了Q (1 <= Q <= 180,000) 个可能的牛的选择和所有牛的身高 (1 <= 身高 <= 1,000,000). 他想知道每一组里面最高和最低的牛的身高差别.
注意: 在最大数据上, 输入和输出将占用大部分运行时间.
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
Sample Input
to a reply and indicates the difference in height between the
tallest and shortest cow in the range.
Sample Output
3
0
#include<cstdio> #include <iostream> #define M 50010 int max(int a,int b){return a>b?a:b;} int min(int a,int b){return a<b?a:b;} struct tree{int l,r,minn,maxx;}tr[4*M]; int a[M]; void make(int l,int r,int p) { tr[p].l=l; tr[p].r=r; if(l==r){ tr[p].minn=a[l]; tr[p].maxx=a[l]; return ; } int mid=(l+r)>>1; make(l,mid,p<<1); make(mid+1,r,p<<1|1); tr[p].minn=min(tr[p<<1].minn,tr[p<<1|1].minn); tr[p].maxx=max(tr[p<<1].maxx,tr[p<<1|1].maxx); } int fmin(int l,int r,int x) { if(tr[x].l==l&&tr[x].r==r) return tr[x].minn; int mid=(tr[x].l+tr[x].r)>>1,q=x<<1; if(r<=mid) return fmin(l,r,q); else if(l>mid) return fmin(l,r,q+1); else return min(fmin(l,mid,q),fmin(mid+1,r,q+1)); } int fmax(int l,int r,int x) { if(tr[x].l==l&&tr[x].r==r) return tr[x].maxx; int mid=(tr[x].l+tr[x].r)>>1; if(r<=mid) return fmax(l,r,x<<1); else if(l>mid) return fmax(l,r,x<<1|1); else return max(fmax(l,mid,x<<1),fmax(mid+1,r,x<<1|1)); } int main() { int n,m,i,x,y; scanf("%d%d",&n,&m); for(i=1;i<=n;i++) scanf("%d",&a[i]); make(1,n,1); for(i=0;i<m;i++){ scanf("%d%d",&x,&y); printf("%d\n",fmax(x,y,1)-fmin(x,y,1)); } }
标签:
版权申明:本站文章部分自网络,如有侵权,请联系:west999com@outlook.com
特别注意:本站所有转载文章言论不代表本站观点,本站所提供的摄影照片,插画,设计作品,如需使用,请与原作者联系,版权归原作者所有
- bzoj3569 DZY Loves Chinese II 2020-05-25
- bzoj4036 [HAOI2015]按位或 2020-04-26
- 「BZOJ4173」数学 2020-01-15
- bzoj3944 Sum 2019-12-25
- BZOJ1008: [HNOI2008]越狱(快速幂) 2019-08-26
IDC资讯: 主机资讯 注册资讯 托管资讯 vps资讯 网站建设
网站运营: 建站经验 策划盈利 搜索优化 网站推广 免费资源
网络编程: Asp.Net编程 Asp编程 Php编程 Xml编程 Access Mssql Mysql 其它
服务器技术: Web服务器 Ftp服务器 Mail服务器 Dns服务器 安全防护
软件技巧: 其它软件 Word Excel Powerpoint Ghost Vista QQ空间 QQ FlashGet 迅雷
网页制作: FrontPages Dreamweaver Javascript css photoshop fireworks Flash