小技巧

//离散化数组
 for (int i = 1; i <= n; i++) {
            scanf("%d", &a[i]);
            b[i] = a[i];
        }
        sort(a + 1, a + 1 + n);
        int cnt = unique(a + 1, a + 1 + n) - a - 1;
        for (int i = 1; i <= n; i++)
            b[i] = lower_bound(a + 1, a + 1 + cnt, b[i]) - a;
        for (int i = 1; i <= n; i++)
            cout << b[i] << endl;

 

//将一个数转换为A - Z的进制，比如3 -> C  34 -> AH  123 -> DS
void K(int n)
{
    if(n>26)
        K((n-1)/26);

    printf("%c",(n-1)%26+'A');
}

 

转载于:https://www.cnblogs.com/smallhester/p/11346254.html