ZOJ 3633Alice's present

这道题是求区间内出现多次的数字，数据很大。。不能hash、、用set过的啊、、

Alice's present

---

Time Limit: 5 Seconds       Memory Limit: 65536 KB

---

As a doll master, Alice owns a wide range of dolls, and each of them has a number tip on it's back, the tip can be treated as a positive integer. (the number can be repeated). One day, Alice hears that her best friend Marisa's birthday is coming , so she decides to sent Marisa some dolls for present. Alice puts her dolls in a row and marks them from 1 to n. Each time Alice chooses an interval from i to j in the sequence ( include i and j ) , and then checks the number tips on dolls in the interval from right to left. If any number appears more than once , Alice will treat this interval as unsuitable. Otherwise, this interval will be treated as suitable.

This work is so boring and it will waste Alice a lot of time. So Alice asks you for help .

Input

There are multiple test cases. For each test case:

The first line contains an integer n ( 3≤ n ≤ 500,000) ,indicate the number of dolls which Alice owns.

The second line contains n positive integers , decribe the number tips on dolls. All of them are less than 2^31-1. The third line contains an interger m ( 1 ≤ m ≤ 50,000 ),indicate how many intervals Alice will query. Then followed by m lines, each line contains two integer u, v ( 1≤ u< v≤ n ),indicate the left endpoint and right endpoint of the interval. Process to the end of input.

Output

For each test case:

For each query, If this interval is suitable , print one line "OK". Otherwise, print one line ,the integer which appears more than once first.

Print an blank line after each case.

Sample Input

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

Sample Output

1
2
OK

3
3
3
OK

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <set>
#define N 501000

using namespace std;

long v[N], f[N];

int main()
{
    int n, m, l, r, i;
    while(~scanf("%d",&n))
    {
        for(i = 1; i <= n; i++)
        {
            scanf("%ld",&f[i]);
        }
        scanf("%d",&m);
        while(m--)
        {
            scanf("%d %d",&l, &r);
            set<int> a;
            bool flat = false;
            for(i = r; i >= l; i--)
            {
                if (!a.insert(f[i]).second)
                {
                    cout << f[i] << endl;
                    flat = true;
                    break;
                }
            }
            if (!flat) cout << "OK" << endl;
        }
        printf("\n");
    }
    return 0;
}