# P2880 [USACO07JAN]平衡的阵容Balanced Lineup

## 题目描述

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.

## 输入输出格式

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.

## 输入输出样例

```6 3
1
7
3
4
2
5
1 5
4 6
2 2```

```6
3
0

``` 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;
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 {
32     for(int i=1;i<=n;i++)
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     {
41         printf("%d\n",getmax(x,y)-getmin(x,y));
42     }
43     return 0;
44 }```

0 条评论

• ### HDU 3032 Nim or not Nim?(Multi-Nim)

Problem Description Nim is a two-player mathematic game of strategy in which ...

• ### POJ 3461 kmp

Oulipo Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 40168 ...

• ### 洛谷P3531 [POI2012]LIT-Letters

题目描述 Little Johnny has a very long surname. Yet he is not the only such person i...

• ### POJ--1699 Best Sequence（DP+dfs）

Best Sequence Time Limit: 1000MS Memory Limit: 10000K Total Submissions...

• ### HOJ 2226&POJ2688 Cleaning Robot（BFS+TSP（状态压缩DP））

Cleaning Robot Time Limit: 1000MS Memory Limit: 65536K Total Submission...

• ### 【Codeforces】1217A - Creating a Character

版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。 ...

• ### Codeforces 833D Red-black Cobweb【树分治】

D. Red-black Cobweb time limit per test：6 seconds memory limit per test：256 mega...

• ### HDUOJ----2489 Minimal Ratio Tree

Minimal Ratio Tree Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768...

• ### HDUOJ----（1031）Design T-Shirt

Design T-Shirt Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/327...

• ### 多语言姿态检测：加泰罗尼亚独立语料库(CS.CL)

姿态检测旨在确定给定文本相对于特定主题或主张的态度。尽管最近几年对姿势检测进行了很好的研究，但大多数工作都集中在英语上。这主要是由于其他语言中相对缺少带注释的数...