陈老师的多校联合20140815 ||uvalive 5881 区间处理

最新推荐文章于 2021-08-27 18:39:11 发布

life4711

最新推荐文章于 2021-08-27 18:39:11 发布

阅读量947

点赞数

分类专栏： 2014多校联合

本文链接：https://blog.csdn.net/lvshubao1314/article/details/38590087

版权

2014多校联合专栏收录该内容

26 篇文章 0 订阅

订阅专栏

https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3892

The security of many ciphers strongly depends on the fact that the keys are unique and never re-used. This may be vitally important, since a relatively strong cipher may be broken if the same key is used to encrypt several different messages.

In this problem, we will try to detect repeating (duplicate) usage of keys. Given a sequence of keys used to encrypt messages, your task is to determine what keys have been used repeatedly in some specified period.

Input

The input contains several cipher descriptions. Each description starts with one line containing two integer numbers M and Q separated by a space. M (1 $\le$ M $\le$ 1000000) is the number of encrypted messages, Q is the number of queries (0 $\le$ Q $\le$ 1000000).

Each of the following M lines contains one number K_i (0 $\le$ K_i $\le$ 2³⁰) specifying the identifier of a key used to encrypt the i-th message. The next Q lines then contain one query each. Each query is specified by two integer numbers B_j and E_j, 1 $\le$ B_j $\le$ E_j $\le$ M, giving the interval of messages we want to check.

There is one empty line after each description. The input is terminated by a line containing two zeros in place of the numbers M and Q.

Output

For each query, print one line of output. The line should contain the string ``OK" if all keys used to encrypt messages between B_j and E_j (inclusive) are mutually different (that means, they have different identifiers). If some of the keys have been used repeatedly, print one identifier of any such key.

Print one empty line after each cipher description.

Sample Input

Sample Output

3
OK
4
3
OK

OK
1

题目大意：给出一段区间判断是否在这一段区间上有重复数字出现

解题思路：用b数组存储a[i]后面与a[i]最近的重复数字的位置

#include <string.h>
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <map>
using namespace std;
map<int,int>p;
const int maxn=1000000+10;
int a[maxn],v[maxn],b[maxn];
int n,m;
int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        if(n==0&&m==0)
            break;
        p.clear();
        for(int i=1;i<=n;i++)
            scanf("%d",&a[i]);
        b[n+1]=n+1;
        for(int i=n;i>0;i--)
        {
            b[i]=b[i+1];
            if(p[a[i]])
                b[i]=min(p[a[i]],b[i]);
            p[a[i]]=i;
        }
        while(m--)
        {
            int x,y;
            scanf("%d%d",&x,&y);
            if(b[x]>y)
                printf("OK\n");
            else
                printf("%d\n",a[b[x]]);
        }
        printf("\n");

    }
}