POJ 3264 Balanced Lineup
来源:互联网 发布:linux alias命令用法 编辑:程序博客网 时间:2024/06/15 17:03
Balanced Lineup
Time Limit: 5000MS Memory Limit: 65536K
Case 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.
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.
题目翻译:
平衡的阵容
题目描述:
给你一个有n个数的序列,有Q次询问,每次询问给定一个区间[l,r],求第l个数到第r个数的区间最大值减去区间最小值。
ST表裸题,我就来扔个板子= =。
#include<algorithm>#include<cstdio>#include<cmath>using namespace std;const int maxn=50000+500;int num[maxn];int st[maxn][30];int st1[maxn][30];int n;void ST(){ for(int i=1;i<=n;i++) st[i][0]=st1[i][0]=num[i]; int k=(log(n)/log(2)); for(int j=1;j<=k;j++) { for(int i=1;i<=n;i++) { if(i+(1<<(j-1))<=n) { st[i][j]=max(st[i][j-1],st[i+(1<<(j-1))][j-1]); st1[i][j]=min(st1[i][j-1],st1[i+(1<<(j-1))][j-1]); } } }}int ask_max(int x,int y){ int k=log(y-x+1)/log(2); return max(st[x][k],st[y-(1<<k)+1][k]);}int ask_min(int x,int y){ int k=log(y-x+1)/log(2); return min(st1[x][k],st1[y-(1<<k)+1][k]);}int main(){ int q; scanf("%d%d",&n,&q); for(int i=1;i<=n;i++) scanf("%d",&num[i]); ST(); while(q--) { int a,b; scanf("%d%d",&a,&b); printf("%d\n",ask_max(a,b)-ask_min(a,b)); } return 0;}
- POJ 3264 Balanced Lineup
- POJ 3264 Balanced Lineup
- poj 3264 Balanced Lineup
- poj 3264 Balanced Lineup
- poj 3264 Balanced Lineup
- poj 3264 Balanced Lineup
- Poj 3264 Balanced Lineup
- poj 3264 Balanced Lineup
- POJ-3264-Balanced Lineup
- poj 3264 Balanced Lineup
- poj 3264 Balanced Lineup
- POJ 3264-Balanced Lineup
- poj 3264 Balanced Lineup
- POJ 3264 Balanced Lineup
- POJ-3264-Balanced Lineup
- POJ 3264 Balanced Lineup
- POJ 3264 Balanced Lineup
- poj 3264 Balanced Lineup
- C++ 设计模式之中介者模式
- 静态加载界面文件和动态加载
- 献给写作者的 Markdown 新手指南
- AlertDialog通过反射机制阻止Dialog关闭
- Log4j的使用及原理
- POJ 3264 Balanced Lineup
- 日本語:日常会话4-レストランについて
- SSM整合tomcat服务器启动不了,控制台log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more
- Swift 3实现简单条形码功能
- 火狐 SSL 收到了一个弱临时 Diffie-Hellman 密钥
- 实现智能读报(逐字朗读+自动滚屏)
- UIViewController-iOS-Apple官方文档翻译注释总结
- 利用fullpage.js插件实现全屏滚动
- iframe跨文档传输(postMessage跨域)