离散化模板

#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 10;
int n, d[N]; //n个数 离散化后数组
struct node {
    int x, id;
    bool operator<(const node& t)const {
        //按照值小的排前面 值相同先出现的排前面 可调整
        return x == t.x ? id < t.id : x < t.x;
    }
} a[N];
signed main() {
    cin >> n;
    for(int i = 1; i <= n; i++) {
        cin >> a[i].x;
        a[i].id = i;
    }

    sort(a + 1, a + 1 + n);

    for(int i = 1; i <= n; i++) {
        d[a[i].id] = i;
    }

    for(int i = 1; i <= n; i++) cout << d[i] << " ";

    return 0;
}
/*
input1:
5
2 1 99 100 4
output1:
2 1 4 5 3

input2:
5
1 1 100 99 1
1 2 5 4 3
*/