【BZOJ 1636】 [Usaco2007 Jan]Balanced Lineup
来源:互联网 发布:12306购票软件下载 编辑:程序博客网 时间:2024/06/11 00:36
1636: [Usaco2007 Jan]Balanced Lineup
Time Limit: 5 Sec Memory Limit: 64 MBSubmit: 516 Solved: 374
[Submit][Status]
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.
Output
6 3 1 7 3 4 2 5 1 5 4 6 2 2
Sample Input
* 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.
to a reply and indicates the difference in height between the
tallest and shortest cow in the range.
Sample Output
6
3
0
HINT
Source
Silver
RMQ水题。
预处理出max,min的RMQ数组,对于每个询问找max-min即可。
#include <iostream>#include <cmath>#include <algorithm>#include <cstring>#include <cstdio>using namespace std;int maxx,minn,n,q,a[50005],mi[50005][20],ma[50005][20];void RMQ(){for (int i=1;i<=n;i++)mi[i][0]=ma[i][0]=a[i];for (int j=1;(1<<j)<n;j++)for (int i=1;i+(1<<j)-1<=n;i++)mi[i][j]=min(mi[i][j-1],mi[i+(1<<(j-1))][j-1]),ma[i][j]=max(ma[i][j-1],ma[i+(1<<(j-1))][j-1]);}int Getlog(int x){int now=1;if (x==1) return 0;for (int i=1;i<=100;i++){now*=2;if (x==now||x<now*2) return i;}}void Ask(int l,int r){int k=Getlog(r-l+1);maxx=max(ma[l][k],ma[r-(1<<k)+1][k]);minn=min(mi[l][k],mi[r-(1<<k)+1][k]);}int main(){ scanf("%d%d",&n,&q);for (int i=1;i<=n;i++)scanf("%d",&a[i]);RMQ();while (q--){int x,y;scanf("%d%d",&x,&y);Ask(x,y);printf("%d\n",maxx-minn);}return 0;}
感悟:
好久没写过RMQ,但还清晰的记得怎么写;
但是前两天刚写过树套树,今天写就出了一堆错误。。
充分说明一个问题:对算法一定要理解透彻才能减少错误!!!
1 0
- BZOJ 1636: [Usaco2007 Jan]Balanced Lineup
- 【BZOJ 1636】 [Usaco2007 Jan]Balanced Lineup
- BZOJ 1636: [Usaco2007 Jan]Balanced Lineup
- BZOJ 1636: [Usaco2007 Jan]Balanced Lineup
- BZOJ 1636: [Usaco2007 Jan]Balanced Lineup
- 1636: [Usaco2007 Jan]Balanced Lineup
- BZOJ 1699: [Usaco2007 Jan]Balanced Lineup排队
- bzoj 1699: [Usaco2007 Jan]Balanced Lineup排队
- BZOJ 1699 [USACO2007 Jan] Balanced Lineup排队
- 【bzoj 1699】[Usaco2007 Jan]Balanced Lineup排队
- bzoj 1636 && bzoj 1699: [Usaco2007 Jan]Balanced Lineup排队(RMQ)
- BZOJ 1699 [Usaco2007 Jan]Balanced Lineup排队 线段树
- 【BZOJ】1699 [Usaco2007 Jan]Balanced Lineup排队 ST表
- 【bzoj1636】[Usaco2007 Jan]Balanced Lineup
- bzoj1636: [Usaco2007 Jan]Balanced Lineup
- BZOJ 1699 & 1636 POJ 3264: [Usaco2007 Jan]Balanced Lineup排队 ST算法简介
- bzoj1699[Usaco2007 Jan]Balanced Lineup排队
- [BZOJ1699][Usaco2007 Jan]Balanced Lineup排队
- 文件加密工具(源码分享)
- c语言转汇编的脚本 在linux下
- C语言第十五回合:拜访文件
- 牛人的blog
- java 中的几个小问题
- 【BZOJ 1636】 [Usaco2007 Jan]Balanced Lineup
- iOS进阶面试题----经典10道
- IOS中设置UINavigationBar的各种样式(图片/透明效果/下方内容显示情况)
- 学习scala-hello-world!
- Struts2 自定义Result
- Dijkstra算法实现==2014hiho第23周最短路问题
- 循环嵌套的时间复杂度分析
- Google 的厕所内测文化
- linux 各种配置教程