BZOJ 1636: [Usaco2007 Jan]Balanced Lineup【RMQ】

1636: [Usaco2007 Jan]Balanced Lineup

【题目描述】
传送门

【题解】

是一道RMQ。

代码如下

#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
int n,Q,f[2][50005][31];
int main(){
    #ifndef ONLINE_JUDGE
    freopen("prob.in","r",stdin);
    freopen("prob.out","w",stdout);
    #endif
    scanf("%d%d",&n,&Q);
    memset(f[1],63,sizeof(f[1]));
    for(int i=1;i<=n;i++) scanf("%d",&f[0][i][0]),f[1][i][0]=f[0][i][0];
    for(int j=1;(1<<j)<=n;j++)
    for(int i=1;i<=n-(1<<j)+1;i++)
    f[0][i][j]=max(f[0][i][j-1],f[0][i+(1<<j-1)][j-1]),
    f[1][i][j]=min(f[1][i][j-1],f[1][i+(1<<j-1)][j-1]);
    for(int i=1;i<=Q;i++){
        int L,R;scanf("%d%d",&L,&R);
        int j=log2(R-L+1);
        printf("%d\n",max(f[0][L][j],f[0][R-(1<<j)+1][j])-min(f[1][L][j],f[1][R-(1<<j)+1][j]));
    }
    return 0;
}

转载于:https://www.cnblogs.com/XSamsara/p/9063999.html