模板之离散化

#include "iostream"
#include "cstdio"
#include "cstdlib"
#include "cstring"
#include "ctime"
#include "algorithm"
using namespace std;
#define MAXN 105
#define n 10
int a[MAXN],b[MAXN],c[MAXN];
int main(){
    srand(time(NULL));
    for(int i=0;i<n;i++)a[i]=b[i]=rand();
    for(int i=0;i<n;i++)printf("%d%c",b[i]," \n"[i==n-1]);
    sort(b,b+n);
    int Size=unique(b,b+n)-b;
    cout << Size << endl;
    for(int i=0;i<n;++i)c[i]=lower_bound(b,b+Size,a[i])-b+1;
    for(int i=0;i<n;i++)printf("%d%c",c[i]," \n"[i==n-1]);
    return 0;
}

猜你喜欢

转载自blog.csdn.net/wzx1078132012/article/details/81149574