cf C. New Year Ratings Change

http://codeforces.com/contest/379/problem/C

思路：先排序，然后判断如果rating>ans，ans=rating否则ans++;然后对应的位置输出就可以；

 #include <cstdio>
 #include <cstring>
 #include <map>
 #include <algorithm>
 #define LL __int64
 #define maxn 500010
 using namespace std;
 int t;
 int n;
 LL a[maxn];
 LL b[maxn];
 struct node
 {
     LL x;
     LL id;
     bool operator <(const node &a)const
     {
         return x<a.x;
     }
 }p[maxn];

 int main()
 {
     scanf("%d",&n);
     for(int i=; i<n; i++)
     {
         scanf("%I64d",&a[i]);
         p[i].x=a[i];
         p[i].id=i;
     }
     sort(p,p+n);
     int ans;
     ans=b[p[].id]=p[].x;
     for(int i=; i<n; i++)
     {
         if(p[i].x>ans)
         {
             ans=p[i].x;
             b[p[i].id]=ans;
         }
         else
         {
             ans++;
             b[p[i].id]=ans;
         }
     }
     for(int i=; i<n; i++)
     {
         if(i==)
         printf("%I64d",b[i]);
         else
             printf(" %I64d",b[i]);
     }
     printf("\n");
     return ;
 }