P2880 [USACO07JAN]平衡的阵容Balanced Lineup
题目背景
题目描述:
每天,农夫 John 的N(1 <= N <= 50,000)头牛总是按同一序列排队. 有一天, John 决定让一些牛们玩一场飞盘比赛. 他准备找一群在对列中为置连续的牛来进行比赛. 但是为了避免水平悬殊,牛的身高不应该相差太大. John 准备了Q (1 <= Q <= 180,000) 个可能的牛的选择和所有牛的身高 (1 <= 身高 <= 1,000,000). 他想知道每一组里面最高和最低的牛的身高差别.
输入:
第1行:N,Q
第2到N+1行:每头牛的身高
第N+2到N+Q+1行:两个整数A和B,表示从A到B的所有牛。(1<=A<=B<=N)
输出:
输出每行一个数,为最大数与最小数的差
题目描述
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.
一个农夫有N头牛,每头牛的高度不同,我们需要找出最高的牛和最低的牛的高度差。
输入输出格式
输入格式:
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 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.
输入输出样例
输入样例#1:
6 3
1
7
3
4
2
5
1 5
4 6
2 2
输出样例#1:
6
3
0
裸地ST表
1 #include<iostream>
2 #include<cstdio>
3 #include<cstring>
4 #include<cmath>
5 #include<algorithm>
6 #define LL long long
7 #define lb(x) ((x)&(-x))
8 using namespace std;
9 const int MAXN=500001;
10 inline int read()
11 {
12 char c=getchar();int x=0,f=1;
13 while(c<'0'||c>'9') {if(c=='-') f=-1;c=getchar();}
14 while(c>='0'&&c<='9') x=x*10+c-48,c=getchar();return x*f;
15 }
16 int dpmin[MAXN][21];
17 int dpmax[MAXN][21];
18 int n,m;
19 int getmax(int l,int r)
20 {
21 int k=log2(r-l+1);
22 return max(dpmax[l][k],dpmax[r-(1<<k)+1][k]);
23 }
24 int getmin(int l,int r)
25 {
26 int k=log2(r-l+1);
27 return min(dpmin[l][k],dpmin[r-(1<<k)+1][k]);
28 }
29 int main()
30 {
31 n=read();m=read();
32 for(int i=1;i<=n;i++)
33 dpmax[i][0]=read(),dpmin[i][0]=dpmax[i][0];
34 for(int i=1;i<=19;i++)
35 for(int j=1;j<=n&&j+(1<<i)-1<=n;j++)
36 dpmax[j][i]=max(dpmax[j][i-1],dpmax[j+(1<<i-1)][i-1]),
37 dpmin[j][i]=min(dpmin[j][i-1],dpmin[j+(1<<i-1)][i-1]);
38 for(int i=1;i<=m;i++)
39 {
40 int x=read(),y=read();
41 printf("%dn",getmax(x,y)-getmin(x,y));
42 }
43 return 0;
44 }
- JavaScript 教程
- JavaScript 编辑工具
- JavaScript 与HTML
- JavaScript 与Java
- JavaScript 数据结构
- JavaScript 基本数据类型
- JavaScript 特殊数据类型
- JavaScript 运算符
- JavaScript typeof 运算符
- JavaScript 表达式
- JavaScript 类型转换
- JavaScript 基本语法
- JavaScript 注释
- Javascript 基本处理流程
- Javascript 选择结构
- Javascript if 语句
- Javascript if 语句的嵌套
- Javascript switch 语句
- Javascript 循环结构
- Javascript 循环结构实例
- Javascript 跳转语句
- Javascript 控制语句总结
- Javascript 函数介绍
- Javascript 函数的定义
- Javascript 函数调用
- Javascript 几种特殊的函数
- JavaScript 内置函数简介
- Javascript eval() 函数
- Javascript isFinite() 函数
- Javascript isNaN() 函数
- parseInt() 与 parseFloat()
- escape() 与 unescape()
- Javascript 字符串介绍
- Javascript length属性
- javascript 字符串函数
- Javascript 日期对象简介
- Javascript 日期对象用途
- Date 对象属性和方法
- Javascript 数组是什么
- Javascript 创建数组
- Javascript 数组赋值与取值
- Javascript 数组属性和方法