zoj 3633

排序+map乱搞题

#include<cstdio>
#include<map>
#include<algorithm>
#define N 500100
#define Q 50100
using namespace std;
struct Query{
    int l,r,id,ans;
}query[Q];
bool cmp1(struct Query a,struct Query b){
    return a.r>b.r;
}
bool cmp2(struct Query a,struct Query b){
    return a.id<b.id;
}
int main(){
    int n,m,i,j;
    int a[N];
    map<int,int>mm;
    while(scanf("%d",&n)==1){
        for(i=1;i<=n;i++)
            scanf("%d",&a[i]);
        scanf("%d",&m);
        for(i=1;i<=m;i++){
            scanf("%d %d",&query[i].l,&query[i].r);
            query[i].id=i;
            query[i].ans=0;
        }
        sort(query+1,query+1+m,cmp1);
        int s=query[1].r;
        int q=1;
        mm.clear();
        for(i=query[1].r;i>0;i--){
            if(mm[a[i]]==0)
                mm[a[i]]=i;
            else{
                int pre=mm[a[i]];
                while(q<=m && query[q].r>=pre){
                    if(query[q].l<=i)
                        query[q].ans=pre;
                    q++;
                }
                //if(q<=m)
                //    for(;s>query[q].r;s--)
                //        mm.erase(a[s]);   //这段有没有都可以
                mm[a[i]]=i;
            }
        }
        sort(query+1,query+1+m,cmp2);
        for(i=1;i<=m;i++)
            if(query[i].ans==0)
                printf("OK\n");
            else
                printf("%d\n",a[query[i].ans]);
        printf("\n");
    }
}

或者用线段树，节点保留的是其左边与其相等的最大坐标，每次查询返回区间最大值即可