codeforces 379CNew Year Ratings Change(MAP的用法)

Description

One very well-known internet resource site (let's call it X) has come up with a New Year adventure. Specifically, they decided to give ratings to all visitors.

There are n users on the site, for each user we know the rating value he wants to get as a New Year Present. We know that user i wants to get at least a_i rating units as a present.

The X site is administered by very creative and thrifty people. On the one hand, they want to give distinct ratings and on the other hand, the total sum of the ratings in the present must be as small as possible.

Help site X cope with the challenging task of rating distribution. Find the optimal distribution.

Input

The first line contains integer n(1 ≤ n ≤ 3·10⁵) — the number of users on the site. The next line contains integer sequencea₁, a₂, ..., a_n(1 ≤ a_i ≤ 10⁹).

Output

Print a sequence of integers b₁, b₂, ..., b_n. Number b_i means that user i gets b_i of rating as a present. The printed sequence must meet the problem conditions.

If there are multiple optimal solutions, print any of them.

Sample Input

Input

3
5 1 1

Output

5 1 2

Input

1
1000000000

Output

1000000000

很多人没有注意到n最大可到3*10^5,采用暴力的方法 结果可想而知 超

时。。。还有此时用C++中的cin 输入的话也会超时 得用scanf.

暴力的代码如下

#include <iostream>
#include <cstdio>
#include <cstring>
#define N 300010
using namespace std;
int a[N];
int find(int x,int y)
{
    for(int i=0;i<x;i++)
    {
        if(a[i]==y)
        {
            return 0;
        }
    }
    return 1;
}
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        memset(a,0,sizeof(a));
        int flag=1;
        for(int i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
            for(;find(i,a[i])==0;)
                a[i]++;
                if(flag)
                    flag=0;
                else
                    printf(" ");
            cout<<a[i];
        }
        printf("\n");
    }
    return 0;
}
正确的做法应该是用map 来标记判断数字是否出现过 

map<int,int> next  map<主键，储存值>

代码如下

#include <iostream>
#include <cstdio>
#include <map>
using namespace std;
map<int,int> next;
int getNext(int k)
{
    if (next[k]==0)
        return k;
    return next[k]=getNext(next[k]);
}
int main()
{
    int n;
    while(~scanf("%d",&n))
    {

    for (int i=0;i<n;i++)
    {
    int a;
       scanf("%d",&a);
    int r=getNext(a);
     cout<<r<<" ";
     next[r]=r+1;//每次在自身的身上加一，贪心的思想 每次得到的数是最小的
    }            //最后得到的和肯定也是最小的
    }
return 0;
}