离散化数据模板

#include <bits/stdc++.h>
const int MAXN = 1e4 +5;
using namespace std; 
int L[MAXN], R[MAXN];

struct Hash{
    int data[MAXN], tol;

    void init(){
        tol = 0;
    }

    void solve(){
        sort(data, data + tol);
        tol = unique(data, data + tol) - data;
//        int _tol = tol;
//        for(int i = 1; i < _tol; i++){
//            if(data[i] - data[i - 1] > 1){
//                data[tol++] = data[i - 1] + 1;
//            }
//        }
//        sort(data, data + tol);
    }

    void push(int v){
        data[tol++] = v;
    }

    int query(int k){
        return data[k];
    }

    int find(int v){
        return lower_bound(data, data + tol, v) - data + 1;
    }
};

Hash hashs;

int main(){
	int n;
	while(cin >> n){
		for(int i = 0; i < n; i++){
			cin >> L[i] >> R[i];
			hashs.push(L[i]); hashs.push(R[i]);
		}
		hashs.solve();
		cout << "************" << endl;
		for(int i = 0; i < n; i++){
			cout << hashs.find(L[i]) <<  "  " << hashs.find(R[i]) << endl; 
		}
		cout << "************" << endl;
	}
}

其他详细内容推荐博客：https://blog.csdn.net/nuoyanli/article/details/86551295