离散化

#include <iostream>
#include <algorithm>

using namespace std;

const int maxn = 1001;

int lsh[maxn], cnt, num[maxn];
int n;

// 重复元素离散化后数字相同
void func1(){
    cin >> n;
    for(int i = 0; i < n; ++i){
        cin >> num[i];
        lsh[i] = num[i];
    }
    sort(lsh, lsh + n);
    cnt = unique(lsh, lsh + n) - lsh - 1; // 将重复的元素都排到后面去，之后用earse()就会达到去重的目的
    for(int i = 0; i < n; ++i){
        num[i] = lower_bound(lsh, lsh + cnt, num[i]) - lsh; // 二分查找，寻找到元素的具体位置
    }
}

struct Node{
    int data, id;
    bool operator < (const Node &a)const{
        return data < a.data;
    }
};

// 不去重

void fun2(){
    Node num[maxn];
    int rank_[maxn] = {0};
    int n;
    cin >> n;
    for(int i = 0; i < n; ++i){
        cin >> num[i].data;
        num[i].id = i;
    }
    sort(num, num + n);
    for(int i = 0; i < n; ++i){
        rank_[num[i].id] = i;
    }
}
int main(){
    return 0;
}