POJ 3368 (RMQ)

最新推荐文章于 2018-10-30 09:50:53 发布

mad_lpx

最新推荐文章于 2018-10-30 09:50:53 发布

阅读量574

点赞数 1

分类专栏： ACM之路文章标签： each query integer input

本文链接：https://blog.csdn.net/mad_lpx/article/details/7427338

版权

ACM之路专栏收录该内容

40 篇文章 1 订阅

订阅专栏

Frequent values

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 9430		Accepted: 3405

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 indicesi andj (1 ≤ i ≤ j ≤ n). For each query, determine the most frequent value among the integersa_i , ... , a_j.

Input

The input consists of several test cases. Each test case starts with a line containing two integersn andq (1 ≤ n, q ≤ 100000). The next line containsn integersa₁ , ... , a_n (-100000 ≤ a_i ≤ 100000, for eachi ∈ {1, ..., n}) separated by spaces. You can assume that for eachi ∈ {1, ..., n-1}: a_i ≤ a_i+1. The followingq lines contain one query each, consisting of two integersi 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.

把原数列转化一下。。。

if (num2[i] == num2[i-1]) num[i] = num[i-1]+1;
else num[i] = 1;

然后对查询区间[l,r]分两部分，前面被切割部分和后面完整部分，前面直接计数，后面完整部分RMQ求最大值

#include<stdio.h>
#include<iostream>
#include<math.h>
#include<string.h>

using namespace std;

#define clear(a,b) memset(a,b,sizeof(a))
#define MAXN 100100
#define mmax(a,b) ((a)>(b)?(a):(b))
#define mmin(a,b) ((a)>(b)?(b):(a))

int num2[MAXN],num[MAXN];
int f1[MAXN][100]; //max


//spatse table

void st(int n)
{
    int i,j,k,m;
    k = (int)(log((double)n)/log(2.0));
    for(i = 1;i <= n;i++)
      f1[i][0] = num[i];
    for(j = 1;j <= k;j++) {
      for(i = 1;i+(1<<j)-1 <= n;i++) {
        m = i + (1<<(j-1));
        f1[i][j] = mmax(f1[i][j-1],f1[m][j-1]);
        }
      }
}

int rmq_max(int i,int j)
{
   if (i > j) return 0;
   int k = (int)(log((double)(j-i+1))/log(2.0));
   return mmax(f1[i][k],f1[j-(1<<k)+1][k]);
}

int work()
{
   int n,q,i,l,r,t;
   scanf("%d",&n);
   if (n == 0) return 0;
   scanf("%d",&q);
   clear(num,0);
   clear(num2,0);
   clear(f1,0);
   num2[0] = MAXN;
   for(i = 1;i <= n;i++) {
     scanf("%d",&num2[i]);
     if (num2[i] == num2[i-1]) num[i] = num[i-1]+1;
       else num[i] = 1;
     }
   st(n);
   for(i = 1;i <= q;i++) {
     scanf("%d%d",&l,&r);
     t = l;
     while (num2[t] == num2[t-1] && t <= r) t++;
     printf("%d\n",mmax(t-l,rmq_max(t,r)));
     }
   return 1;
}

int main()
{
    while(work());
    return 0;
}