POJ 3368 Frequent values (RMQ)

最新推荐文章于 2019-04-22 20:55:27 发布

bupt_xycr

最新推荐文章于 2019-04-22 20:55:27 发布

阅读量200

点赞数

分类专栏： Sparse-Table算法

本文链接：https://blog.csdn.net/u013077144/article/details/51212011

版权

Sparse-Table算法专栏收录该内容

2 篇文章 0 订阅

订阅专栏

http://poj.org/problem?id=3368

Frequent values

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 13897		Accepted: 5093

Description

You are given a sequence of n integers a₁ , a₂ , ... , a_n 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 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 ≤ n, q ≤ 100000). The next line contains n integers a₁ , ... , a_n (-100000 ≤ a_i ≤ 100000, for each i ∈ {1, ..., n}) separated by spaces. You can assume that for each i ∈ {1, ..., n-1}: a_i ≤ a_i+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

Source

Ulm Local 2007

题意是：求区间内出现频率最高的那个数字的频数；

很好的一道题目。相同的进行合并然后分情况讨论。具体看代码

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<vector>
#include<cmath>
#include<stdlib.h>
#include<iomanip>
#include<list>
#include<deque>
#include<map>
#include <stdio.h>
#include <queue>
#include <stack>
#define maxn 100005
#define ull unsigned long long
#define ll long long
#define reP(i,n) for(i=1;i<=n;i++)
#define rep(i,n) for(i=0;i<n;i++)
#define cle(a) memset(a,0,sizeof(a))
#define mod 90001
#define PI 3.141592657
#define INF 1<<30
const ull inf = 1LL << 61;
const double eps=1e-5;

using namespace std;
struct node
{
	int s,e;
}line[maxn];

int dp[maxn][20];
int a[maxn];
int pos[maxn];

void rmq_init(int n)
{
	for(int i=0;i<n;i++)
		dp[i][0]=line[i+1].e-line[i+1].s+1;
	for(int j=1;(1<<j)<=n;j++)
		for(int i=0;i+(1<<j)-1<n;i++)
		dp[i][j]=max(dp[i][j-1],dp[i+(1<<(j-1))][j-1]);
}
int rmq(int l,int r)
{
	int k=0;
	while((1<<(k+1))<=r-l+1)k++;
		return max(dp[l][k],dp[r-(1<<k)+1][k]);
}
int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int t,m;a[0]=INF;
    while(~scanf("%d",&t)&&t)
	{
		scanf("%d",&m);
		int num=0;//线段的数量
		for(int i=1;i<=t;i++)
		{
			scanf("%d",&a[i]);
			if(a[i]!=a[i-1])
			{
				num++;
				pos[i]=num;
				line[num].e=line[num].s=i;
			}
			else
			{
				pos[i]=num;
				line[num].e++;
			}
		}
		int x,y;rmq_init(num);
		for(int i=1;i<=m;i++)
		{
			scanf("%d%d",&x,&y);
			if(pos[x]==pos[y])//在一个区间
			{
				printf("%d\n",y-x+1);
			}
			else if(pos[y]-pos[x]==1)//相邻
			{
				printf("%d\n",max(y-line[pos[y]].s+1,line[pos[x]].e-x+1));
			}
			else if(pos[y]-pos[x]!=1)
			{
				int p=max(y-line[pos[y]].s+1,line[pos[x]].e-x+1);
				int q=rmq(pos[x]+1-1,pos[y]-1-1);
				printf("%d\n",max(p,q));
			}
		}
	}
    return 0;
}