UVA11991 Easy Problem from Rujia Liu?

Problem E

Easy Problem from Rujia Liu?

Though Rujia Liu usually sets hard problems for contests (for example, regional contests like Xi'an 2006, Beijing 2007 and Wuhan 2009, or UVa OJ contests like Rujia Liu's Presents 1 and 2), he occasionally sets easy problem (for example, 'the Coco-Cola Store' in UVa OJ), to encourage more people to solve his problems :D

Given an array, your task is to find the k-th occurrence (from left to right) of an integer v. To make the problem more difficult (and interesting!), you'll have to answer m such queries.

Input

There are several test cases. The first line of each test case contains two integers n, m(1<=n,m<=100,000), the number of elements in the array, and the number of queries. The next line contains n positive integers not larger than 1,000,000. Each of the following m lines contains two integer k and v (1<=k<=n, 1<=v<=1,000,000). The input is terminated by end-of-file (EOF). The size of input file does not exceed 5MB.

Output

For each query, print the 1-based location of the occurrence. If there is no such element, output 0 instead.

Sample Input

8 4
1 3 2 2 4 3 2 1
1 3
2 4
3 2
4 2

Output for the Sample Input

2
0
7
0

题意就是求：v第k次出现时的位置，没有则输出0

1.排序时记录Ai原来的位置，及每一个元素首次出现时的排好序之后的位置。

2.貌似还可以用STL里面的map，不过我还不懂~~=_=。

#include<iostream>
#include<string.h>
using namespace std;
struct problem
{
    int v;
    int position;
}A[100005];
int head[1000005];
void max_heapify(problem *A,int i,int n)
{
    int largest=i;
    int l=2*i;
    int r=2*i+1;
    if(l<=n)//保证最上面的元素始终是最大且原来位置靠后的元素
       if(A[l].v>A[i].v||(A[l].v==A[i].v&&A[l].position>A[i].position))
        largest=l;
    if(r<=n)//保证最上面的元素始终是最大且原来位置靠后的元素
       if(A[r].v>A[largest].v||(A[r].v==A[largest].v&&A[r].position>A[largest].position))
        largest=r;
    if(largest!=i)
    {
        problem temp=A[i];
        A[i]=A[largest];
        A[largest]=temp;
        max_heapify(A,largest,n);
    }
}
void build_max_heap(problem *A,int n)
{
    int i;
    for(i=n/2;i>=1;i--)
        max_heapify(A,i,n);
}

void heapsort(problem *A,int n)//堆排
{
    build_max_heap(A,n);
    int i;
    for(i=n;i>=2;i--)//注意A[1]没有参与记录
    {
        problem temp;
        temp=A[i];
        A[i]=A[1];
        A[1]=temp;
        head[A[i].v]=i;//记录首次元素出现的位置
        n=n-1;
        max_heapify(A,1,n);
    }
}


int main()
{
    int n,m;
    while(cin>>n>>m)
    {
        int i;
        memset(head,0,sizeof(head));
        for(i=1;i<=n;i++)
        {
            cin>>A[i].v;
            A[i].position=i;
        }
        heapsort(A,n);
        head[A[1].v]=1;//注意最小值可能没有记录正确的位置
        while(m--)
        {
            int k,v;
            cin>>k>>v;
            if(head[v]&&(head[v]+k-1<=n)&&A[head[v]+k-1].v==v)//判断
                cout<<A[head[v]+k-1].position<<endl;
            else
                cout<<0<<endl;
        }
    }
    return 0;
}

测试    495ms c++11 4.8.2           512ms c++4.8.2

还是有些慢了。。。

第一次发博客