#include <iostream>
#include <cstdio>
#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <stack>
#include <vector>
#include <cstring>
#include <algorithm>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define pb push_back
#define T int T;scanf("%d",&T);while(T--)
const ll mod=1e9+7;
const int maxn = 2e5 + 10;
int a[maxn];
int main(){
int n;
cin >> n;
set<int> s;
for(int i = 0; i < n; i ++){
int p;
cin >> a[i];
s.insert(a[i]);
}
int cnt = 1;
map<int,int> mp;
for(set<int>::iterator it = s.begin(); it!=s.end(); it++){
mp[*it] = cnt++;
}
for(int i = 0; i < n; i ++){
a[i] = mp[a[i]];
}
return 0;
}
/*
*/
离散化
最新推荐文章于 2022-11-15 09:52:40 发布