User: 离散化模板
Time: 2019-07-24 19:22:27
#include <iostream>
#include<bits/stdc++.h>
using namespace std;

int main()
{

    int a[100],b[1000],n;
    cin>>n;
    for(int i=1;i<=n;i++){

       cin>>a[i];
       b[i] = a[i];
    }
     sort(b+1,b+1+n);

     int len  = unique(b+1,b+1+n)-b-1;

    for(int i=1;i<=n;i++){

        int id = lower_bound(b+1,b+1+len,a[i])-b;
        cout<<id<<" ";
    }
    return 0;
}