yp0x05

排序

poj3784

#include <bits/stdc++.h>
#define ll long long
#define fo(i, j, n) for (register int i = j; i <= n; ++i)
using namespace std;
priority_queue<int, vector<int>, less<int>> L;    // 大根堆
priority_queue<int, vector<int>, greater<int>> R; // 小根堆

void init()
{
    while (!L.empty())
        L.pop();
    while (!R.empty())
        R.pop();
}
int T, num, x, n, pos;

int main()
{
    scanf("%d", &T);
    while (T--)
    {
        init();
        scanf("%d%d", &num, &n);
        printf("%d %d\n", num, (n + 1) / 2);
        scanf("%d", &x);
        printf("%d", x);
        pos = 1;
        L.push(x);
        for (register int i = 2; i <= n; ++i)
        {
            scanf("%d", &x);
            if (x > L.top())
                R.push(x);
            else
                L.push(x);
            if (i & 1)
            {
                if (pos == 10)
                    putchar(10), pos = 0; // 10个一行输出
                else
                    putchar(' ');
                if (L.size() > R.size())
                    printf("%d", L.top());
                else
                    printf("%d", R.top());
                pos++;
            }
            else
            {
                if (L.size() > R.size())
                    R.push(L.top()), L.pop();
                if (L.size() < R.size())
                    L.push(R.top()), R.pop(); //注意这是两行if语句不是if else
            }
        }
        if (pos % 10 != 0)
            putchar(10);
    }
    return 0;
}

第k大数

cnt:大于基准值的个数
将大于基准值的数置于左边
k<=cnt  就在左边找k
如果cnt >k 右半段寻找k-cnt

逆序对

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define pii pair<int, int>
#define psi pair<string, int>
#define ull unsigned ll
#define pb push_back
#define mp make_pair
#define ld long double
const int N = 1E5 + 7;
#define INF ~0ULL
int a[N], b[N], cnt;
int n;

void merge(int l, int mid, int r)
{
    //合并a[l~mid] 与a[mid+1,r]
    //a是待排序数组，b是临时数组，cnt 是逆序对个数
    int i = l, j = mid + 1;
    for (int k = l; k <= r; k++)
    {
        if (j > r || i <= mid && a[i] <= a[j]) //j没了，i没完，值小
            b[k] = a[i++];
        else
            b[k] = a[j++], cnt += mid - i + 1; //没用到a[i],所以每一个数都构成了逆序数
    }
    for (int k = l; k <= r; k++)
        a[k] = b[k];
}

void ss(int l, int r)
{
    if (l >= r)
        return;
    int mid = (l + r) / 2;
    ss(l, mid);
    ss(mid + 1, r);
    merge(l, mid, r);
}

int main()
{
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    for (int i = 1; i <= n; i++)
    {
        cout << a[i] << " ";
    }
    cout << endl;
    ss(1,n);
    for (int i = 1; i <= n; i++)
    {
        cout << a[i] << " ";
    }
    cout << endl;
    cout << cnt<< endl;
}

奇数码问题

链接: link.