Hdu 3603

Coach Yehr’s punishment

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 397    Accepted Submission(s): 114

Problem Description

During the Mult-University Trainging,Coach Yehr asks all the ACM teammates to jog at 6:30AM.But 6:30 is too early,there are always somebody might be late.Coach Yehr likes AC sequence very much,the AC sequence is a number sequence with all the elements different.A sequence (S₁ ,S₂ ,S₃ ……S_n ) is a AC sequence if S₁ ,S₂ ,S₃ ……S_n are all different. There are N teammates,the time(in second time) every teammate’arrival make a number sequence with length N. In order to punish the laters,Coach Yehr give them a puzzle,Coach Yehr choose a subsequence from S_a to S_b ,the laters must tell Coach Yehr the longest length of AC sequence in the subsequence as soon as possible.

Input

There are multiply text cases.You must deal with it until the end of file.
The first line of each test case is an interger N,indicates the number of ACM teammates;
The second line have N intergers,the i-th number indicates the i-th teammate’s arrival time.
The third line is an interger M indicates Coach Yehr will ask M times;
The follow M lines,each line have two intergers a and b,indicate the interval of the sequence.

Output

For each query,you have to print the longest length of AC sequence in the subsequence in a single line.

Sample Input

8 3 2 5 6 8 3 2 6 2 2 4 1 8 6 5 3 1 2 3 4 1 6 3 3

Sample Output

3 5 4 2

 二分＋ＲＭＱ，　特别注意存在 x > y的查询。

Accepted Code:

/*************************************************************************
    > File Name: 3603.cpp
    > Author: Stomach_ache
    > Mail: sudaweitong@gmail.com
    > Created Time: 2014年07月10日 星期四 21时17分41秒
    > Propose: 
 ************************************************************************/

#include <cmath>
#include <string>
#include <cstdio>
#include <fstream>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;

const int MAX_N = 300002;

int n, m;
int vis[MAX_N], len[MAX_N], rmq[MAX_N][25];

void rmq_init() {
      for (int i = 1; i <= n; i++) rmq[i][0] = len[i];
    for (int j = 1; (1<<j) <= n; j++) {
          for (int i = 1; i+(1<<(j-1))-1 <= n; i++) {
              rmq[i][j] = max(rmq[i][j-1], rmq[i+(1<<(j-1))][j-1]);
        }
    }
}

int RMQ(int L, int R) {
      int k = (int)(log(R - L + 1.0) / log(2.0));     
    return max(rmq[L][k], rmq[R-(1<<k)+1][k]);
}

int solve(int x, int y) {
      int  = x, R = y, ans = -1;
    while (L <= R) {
        int M = (L + R) / 2;
        if (len[M] >= M - x + 1) {
              L = M + 1;
        } else {
              ans = M;
            R = M - 1;
        }
    }
    if (ans == -1) return y - x + 1;
    return max(ans - x, RMQ(ans, y));
}    

int 
main(void) {
    while (~scanf("%d", &n)) {
          memset(vis, 0, sizeof(vis));
          memset(len, 0, sizeof(len));
        int begin = 1;
          for (int i = 1; i <= n; i++) {
              int tmp;
            scanf("%d", &tmp);
            len[i] = min(i-begin+1, i-vis[tmp]);
            begin = max(begin, vis[tmp]+1);
            vis[tmp] = i;
        }
        //for (int i = 1; i <= n; i++) printf("%d
", len[i]);
        rmq_init();
        scanf("%d", &m);
        while (m--) {
              int x, y;
            scanf("%d %d", &x, &y);
            // 测试数据可能会有 x > y　的情况
            if (x > y) swap(x, y);
            printf("%d
", solve(x, y));
        }
    
    }

    return 0;
}