[poj3368]Frequent values

Time Limit: 2000MS
Memory Limit: 65536K
分数：2100，小思维题

Description

You are given a sequence of n integers $a_1,a_2,...,a_n$ in non-decreasing order. In addition to that, you are given several queries consisting of indices $i$ and $j(1\le i\le j\le n)$. For each query, determine the most frequent value among the integers $a_i,...,a_j$.

Input

The input consists of several test cases. Each test case starts with a line containing two integers $n$ and $q(1\le n,q\le 100000)$. The next line contains $n$ integers $a_1,...,a_n(-100000\le ai\le 100000$, for each $i\in 1,...,n)$ separated by spaces. You can assume that for each $i\in 1,...,n-1:a_i\le a_{i+1}$. The following $q$ lines contain one query each, consisting of two integers $i$ and $j(1\le i\le j\le n)$, which indicate the boundary indices for the query.

The last test case is followed by a line containing a single 0.

Output

For each query, print one line with one integer: The number of occurrences of the most frequent value within the given range.

Sample Input

10 3
-1 -1 1 1 1 1 3 10 10 10
2 3
1 10
5 10
0

Sample Output

1
4
3

题意：
给定一个不下降序列，每次查询一个区间，询问这个区间种出现最多的数字的出现次数是多少。

题解：
先对序列进行预处理，处理出$num[i]$表示与$a[i]$相同的$a[j](j<=i)$有多少个。
然后对于一个区间来说，如果这个区间的开头的$num[i]$是$1$我们可以直接查询这个区间的$num[i]$的最大值作为答案，否则的话我们可以找到这个区间最靠前面的$1$，然后，把这个区间分成从这个$1$开始往后的，和这个$1$之前的，之前的可以直接用$num[i]$相减得到，后面的可以用st表查询区间最大值，最后取最大值即可。

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#define ll long long
#define INF 1999122700
using namespace std;
int mm[100004],a[100004];
int f[100004][24],g[100004][24];
int n,q,num[100004];
void prework(){
    mm[0]=-1;
    for(int i=1;i<=n;i++){
        mm[i]=((i&(i-1))==0)?mm[i-1]+1:mm[i-1];
    }
    for(int j=0;j<=mm[n];j++){
        for(int i=1;i+(1<<j)-1<=n;i++){
            if(j==0){
                f[i][j]=num[i];
                g[i][j]=(num[i]==1)?i:INF;
            }
            else{
                f[i][j]=max(f[i][j-1],f[i+(1<<(j-1))][j-1]);
                g[i][j]=min(g[i][j-1],g[i+(1<<(j-1))][j-1]);
            }
        }
    }
}
int query(int x,int y){
    int k=mm[y-x+1];
    int l,r=y;
    l=min(g[x][k],g[y-(1<<k)+1][k]);
    if(l==INF)l=y+1;
    int ret=num[l-1]-num[x-1];
    if(l>r)return ret;
    k=mm[r-l+1];
    ret=max(ret,max(f[l][k],f[r-(1<<k)+1][k]));
    return ret;

}
int w33ha(){
    scanf("%d",&q);
    for(int i=1;i<=n;i++)scanf("%d",&a[i]);
    for(int i=1;i<=n;i++){
        if(a[i]!=a[i-1])num[i]=1;
        else num[i]=num[i-1]+1;
    }
    prework();
    while(q--){
        int l,r;scanf("%d%d",&l,&r);
        printf("%d\n",query(l,r));
    }
    return 0;
}
int main(){
    while(scanf("%d",&n)!=EOF){
        if(n==0)break;
        w33ha();
    }
    return 0;
}