poj 3368 --Frequent values 线段树

Frequent valuesTime Limit: 2000MS Memory Limit: 65536K
Total Submissions: 7364 Accepted: 2636


Description

You are given a sequence of n integers a1 , a2 , ... , an in non-decreasing order. In addition to that, you are given several queries consisting of indices i and j (1 ≤ i ≤ j ≤ n). For each query, determine the most frequent value among the integers ai , ... , aj.

Input

The input consists of several test cases. Each test case starts with a line containing two integers n and q (1 ≤ n, q ≤ 100000). The next line contains n integers a1 , ... , an (-100000 ≤ ai ≤ 100000, for each i ∈ {1, ..., n}) separated by spaces. You can assume that for each i ∈ {1, ..., n-1}: ai ≤ ai+1. The following q lines contain one query each, consisting of two integers i and j (1 ≤ i ≤ j ≤ 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

 

 

//2004K 860MS #include<iostream> using namespace std; #define max(a,b) a>b?a:b #define N 100010 int sum[N]; // index: 1 ~ N int num[N]; struct node { int l,r,max; }tree[N*6]; int Tsearch(int key,int low,int high) { int mid; while (low<=high) { mid=(high+low)>>1; if(key>sum[mid]) low=mid+1; else if(key<sum[mid]) high=mid-1; else break; } if(sum[mid-1]>=key) return mid-1; else if(sum[mid]>=key) return mid; else return mid+1; } void build(int l,int r,int k) { tree[k].l=l; tree[k].r=r; tree[k].max=-1; if(l==r) tree[k].max=num[r]; else { int mid=(l+r)>>1; build(l,mid,k+k); build(mid+1,r,k+k+1); tree[k].max=max(tree[k+k].max,tree[k+k+1].max); } } int quary(int a,int b,int k) { if(a==tree[k].l&&b==tree[k].r) return tree[k].max; else { if(tree[k+k].r>=b) return quary(a,b,k+k); else if(tree[k+k].r<a) return quary(a,b,k+k+1); else return max(quary(a,tree[k+k].r,k+k),quary(tree[k+k+1].l,b,k+k+1)); } } int main() { int n,x,q,i,f,p,s,a,b,j,a1,b1,k,ans,t,c; while(scanf("%d",&n)&&n) { scanf("%d",&q); scanf("%d",&f); p=1,num[p]=1; sum[0]=0; for (i=1;i<n;i++) { scanf("%d",&x); if(x==f) num[p]++; //统计每个数出现的频数 else { f=x; sum[p]=sum[p-1]+num[p]; p++;num[p]=1; } } sum[p]=sum[p-1]+num[p]; p++; build(1,p,1); //对频数建树 while (q--) { scanf("%d%d",&a,&b); i=Tsearch(a,1,p); //查找a,b对应的频数区间 j=Tsearch(b,1,p); t=sum[i]; a1=num[i]-(t-a); ans=num[i]-a1+1; t=sum[j]; b1=num[j]-(t-b); if(i==j) { printf("%d/n",b1-a1+1); continue; } a=i+1; //此时的a,b是频数的一个区间 b=j-1; c=-1; if(a<=b) c=quary(a,b,1); //在[i+1,j-1]这个区间里查找出现频数最高的数 ans=max(ans,c); ans=max(ans,b1); printf("%d/n",ans); } } }