算法竞赛进阶指南——基本算法（排序）

1.电影

https://www.acwing.com/problem/content/105/

1.先把所有语言存储到稀疏数组里
2.稀疏数组排序去重成稠密数组
3.在稠密数组中找每种语言有多少个科学家懂
4.在人数数组中找最多懂语音的
5.如果懂语音的人数相同，就找懂字幕更多的

#include<iostream>
#include<algorithm>
using namespace std;
const int N = 2e5 + 10;
int a[N], b[N], c[N]; //存储每个语言
int d[3 * N], e[3 * N], f[3 * N]; //稀疏数组，稠密数组，人数数组
int t, k, ans, ans1, ans2; //存储下标，答案
int n, m;

//在稠密数组中找下标
int find(int x){
    int l = 0, r = k + 1;
    while(l + 1 < r){
        int mid = (l + r) / 2;
        if(e[mid] < x){
            l = mid;
        }else{
            r = mid;
        }
    }
    return r;
}

int main(){
    cin>>n;
    for(int i = 1; i <= n; i++){
        cin>>a[i];
        d[++t] = a[i];
    }
    cin>>m;
    for(int i = 1; i <= m; i++){
        cin>>b[i];
        d[++t] = b[i];
    }
    for(int i = 1; i <= m; i++){
        cin>>c[i];
        d[++t] = c[i];
    }
    //排序
    sort(d + 1, d + t + 1);
    //去重，得到稠密数组
    for(int i = 1; i <= t; i++){
        if(i == 1 || d[i] != d[i - 1]){
            e[++k] = d[i];
        }
    }
    //计算科学家每一种语言懂的人数
    for(int i = 1; i <= n; i++){
        f[find(a[i])]++;
    }
    for(int i = 1; i <= m; i++){
        //计算语音和字幕每种语言有多少科学家懂
        int ansb = f[find(b[i])], ansc = f[find(c[i])];
        if(ansb > ans1 || (ansb == ans1 && ansc > ans2)){
            ans = i; //更新答案
            ans1 = ansb; //更新语音最多的
            ans2 = ansc; //更新字幕最多的
        }
    }
    //都不懂则随便输出
    if(!ans){
        cout<<1;
    }else{
        cout<<ans;
    }
    return 0;
}

2.货仓选址

https://www.acwing.com/problem/content/106/

建在中间，距离和最小

#include<iostream>
#include<algorithm>
using namespace std;
const int N = 1e5 + 10;
int a[N];
int n, ans;

int main(){
    cin>>n;
    for(int i = 0; i < n; i++){
        cin>>a[i];
    }
    sort(a, a + n);
    int res = a[n / 2];
    for(int i = 0; i < n; i++){
        ans += abs(a[i] - res);
    }
    cout<<ans;
    return 0;
}

3.七夕祭

https://www.acwing.com/problem/content/107/

均分纸牌 + 仓库选址

#include<iostream>
#include<algorithm>
using namespace std;
const int N = 1e5 + 10;
int col[N], row[N]; //存储每行每列感兴趣的摊点数
int c[N]; //前缀和

long long f(int a[], int x){
    int sum = 0;
    for(int i = 1; i <= x; i++){
        sum += a[i];
    }
    sum /= x;
    for(int i = 1; i <= x; i++){
        a[i] -= sum;
    }
    for(int i = 2; i <= x; i++){
        c[i] = c[i - 1] + a[i];
    }
    sort(c + 1, c + x + 1);
    int res = c[(x + 1) / 2];
    long long ans = 0;
    for(int i = 1; i <= x; i++){
        ans += abs(c[i] - res);
    }
    return ans;
}

int main(){
    int n, m, t;
    cin>>n>>m>>t;
    int x, y;
    for(int i = 0; i < t; i++){
        cin>>x>>y;
        row[x]++;
        col[y]++;
    }
    if(t % n && t % m){
        cout<<"impossible";
    }else if(t % n){
        cout<<"column "<<f(col, m);
    }else if(t % m){
        cout<<"row "<<f(row, n);
    }else{
        cout<<"both "<<f(col, m) + f(row, n);
    }
    return 0;
}

4.动态中位数

https://www.acwing.com/problem/content/108/

对顶堆动态维护中位数

#include<iostream>
#include<queue>
using namespace std;
int p;

int main(){
    cin>>p;
    int m, n, x;
    while(p--){
        cin>>m>>n;
        cout<<m<<" "<<(n + 1) / 2<<endl;
        
        priority_queue<int, vector<int>, greater<int>> small; //小根堆，小根堆的堆顶存放中位数
        priority_queue<int> big; //大根堆
        
        int cnt = 0;
        for(int i = 0; i < n; i++){
            cin>>x;
            if(small.empty() || x >= small.top()) small.push(x);
            else big.push(x);
        
            //大根堆多一个元素，多的那个就是中位数
            if(big.size() > small.size()) small.push(big.top()), big.pop();
            if(small.size() > big.size() + 1) big.push(small.top()), small.pop();
            
            //如果整数个数为奇数时
            if(!(i & 1)){
                cnt++;
                cout<<small.top()<<" ";
                if(!(cnt % 10)) cout<<endl; //每10个换个行
            }
        }
        if(cnt % 10) cout<<endl; //如果不足10个也要换行
    }
    return 0;
}

5.超快速排序

https://www.acwing.com/problem/content/description/109/

求逆序对的数量，用并归排序

#include<iostream>
using namespace std;
const int N = 5e5 + 10;
int a[N], b[N];
long long n, ans;

void merge_sort(int l, int r){
    if(l >= r) return;
    int mid = (l + r) / 2;
    merge_sort(l, mid);
    merge_sort(mid + 1, r);
    int k = 0, i = l, j = mid + 1;
    while(i <= mid && j <= r){
        if(a[i] <= a[j]){
            b[k++] = a[i++];
        }else{
            ans += mid - i + 1;
            b[k++] = a[j++];
        }
    }
    while(i <= mid){
        b[k++] = a[i++];
    }
    while(j <= r){
        b[k++] = a[j++];
    }
    for(int i = l, j = 0; i <= r; i++, j++){
        a[i] = b[j];
    }
} 

int main(){
    while(cin>>n && n != 0){
        ans = 0;
        for(int i = 0; i < n; i++){
            cin>>a[i];
        }
        merge_sort(0, n - 1);
        cout<<ans<<endl;
    }
    return 0;
}

6.奇数码问题

https://www.acwing.com/problem/content/110/

如果两个状态的逆序对奇偶性相同，那就可以操作

#include<iostream>
#include<cstring>
using namespace std;
const int N = 505 * 505;
int a[N], b[N];
long long n, res, res1, res2;

void merge_sort(int l, int r){
    if(l >= r) return;
    int mid = (l + r) / 2;
    merge_sort(l, mid);
    merge_sort(mid + 1, r);
    int k = 0, i = l, j = mid + 1;
    while(i <= mid && j <= r){
        if(a[i] <= a[j]){
            b[k++] = a[i++];
        }else{
            res += mid - i + 1;
            b[k++] = a[j++];
        }
    }
    while(i <= mid){
        b[k++] = a[i++];
    }
    while(j <= r){
        b[k++] = a[j++];
    }
    for(int i = l, j = 0; i <= r; i++, j++){
        a[i] = b[j];
    }
}

int main(){
    while(cin>>n){
        int x, y;
        y = 0; 
        for(int i = 0; i < n * n; i++){
            cin>>x;
            if(!x){
                y = 1;
            }else{
                a[i - y] = x;
            }
        }
        res = 0; 
        merge_sort(0, n * n - 2);
        res1 = res;
        
        y = 0; 
        for(int i = 0; i < n * n; i++){
            cin>>x;
            if(!x){
                y = 1;
            }else{
                a[i - y] = x;                
            }
        }
        res = 0;
        merge_sort(0, n * n - 2);
        res2 = res;
        if(res1 % 2 == res2 % 2){
            cout<<"TAK"<<endl;
        }else{
            cout<<"NIE"<<endl;
        }
    }
    return 0;
}