POJ3264——Balanced Lineup
来源:互联网 发布:java实现用户注册登录 编辑:程序博客网 时间:2024/06/05 08:21
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 andQ.
Lines 2..N+1: Line i+1 contains a single integer that is the height of cowi
Lines N+2..N+Q+1: Two integers A and B (1 ≤A ≤ B ≤ N), representing the range of cows from A toB inclusive.
Lines 2..N+1: Line i+1 contains a single integer that is the height of cowi
Lines N+2..N+Q+1: Two integers A and B (1 ≤A ≤ B ≤ N), representing the range of cows from A toB 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
可以线段树,当然我用了RMQ,明天就是网络赛了,求不爆零 ---.---
可以线段树,当然我用了RMQ,明天就是网络赛了,求不爆零 ---.---
#include<cmath>#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>using namespace std;int min_dp[50010][20];int max_dp[50010][20];int val[50010];void max_rmq(int n){for(int i=1;i<=n;i++)max_dp[i][0]=val[i];for(int j=1;(1<<j)<=n;j++)for(int i=1;i+(1<<j)-1<=n;i++)max_dp[i][j]=max(max_dp[i][j-1],max_dp[i+(1<<(j-1))][j-1]);}void min_rmq(int n){for(int i=1;i<=n;i++)min_dp[i][0]=val[i];for(int j=1;(1<<j)<=n;j++)for(int i=1;i+(1<<j)-1<=n;i++)min_dp[i][j]=min(min_dp[i][j-1],min_dp[i+(1<<(j-1))][j-1]);}int st_max(int a,int b){int k=(int)(log(b-a+1.0)/log(2.0));return max(max_dp[a][k],max_dp[b-(1<<k)+1][k]);}int st_min(int a,int b){int k=(int)(log(b-a+1.0)/log(2.0));return min(min_dp[a][k],min_dp[b-(1<<k)+1][k]);}int main(){int n,q;while(~scanf("%d%d",&n,&q)){for(int i=1;i<=n;i++)scanf("%d",&val[i]);max_rmq(n);min_rmq(n);int a,b;for(int i=1;i<=q;i++){scanf("%d%d",&a,&b);int u=st_max(a,b);int v=st_min(a,b);printf("%d\n",u-v);}}return 0;}
0 0
- POJ3264——Balanced Lineup
- poj3264——Balanced Lineup
- poj3264 Balanced Lineup——线段树
- POJ3264——Balanced Lineup(线段树)
- POJ3264——Balanced Lineup 倍增RMQ裸题
- Poj3264: Balanced Lineup—题解+st表解释
- POJ3264 Balanced Lineup
- POJ3264:Balanced Lineup
- poj3264 - Balanced Lineup
- POJ3264 Balanced Lineup
- POJ3264:Balanced Lineup
- POJ3264 Balanced Lineup
- POJ3264-Balanced Lineup RMQ
- poj3264 Balanced Lineup
- [Poj3264][Bzoj1699]Balanced Lineup
- POJ3264 Balanced Lineup
- poj3264 Balanced Lineup
- [POJ3264]Balanced Lineup
- 滑雪 (记忆化搜索)
- 用户中心增加新功能实例
- 基于GraphX实现的community detection算法--Label Propagation分析
- svd奇异值分解
- scanf()、getchar()、gets()、cin之间的区别
- POJ3264——Balanced Lineup
- Javascript中this关键字详解
- 数学之路-分布式计算-hadoop、python与R(1)
- 详解Oracle手动创建数据库几大步骤
- 剑指offer——不用加减乘除做加法
- 数据库的迁移总结及区别比较(Oracle,MySQL,SQLServer)
- linux笔记第四部分
- win7 ubuntu
- UILabel自适应大小的新方法boundingRectWithSize:options:attributes:context: