算法模板(1)

堆排序

删除第一元素： ① heap[1] = heap[size]; size–; ② down(1) 最后一个值覆盖
插入： heap[++size] = x; up(size)
求集合中的最小值： heap[1]

删除任意一个元素: heap[k] = heap[size]; down(k) or up(k) 写两个只会执行一个
修改任意一个元素: heap[k] = x; down(k) or up(k)

void up(int u){
    if(u/2 >= 1 && h[u/2] > h[u]){
        myswap(u,u/2);
        up(u/2);
    }
}

#include <iostream>
#include <algorithm>
using namespace std;

const int N = 100010;
int h[N],si; // 堆的一维数组，si表示h的最后一个下标size
int m,n;

void down(int u){
    int t = u; // t存放当前节点、左孩子、右孩子三者的最小节点下标
    if(u * 2 <= si && h[u*2] < h[t]) t = u*2; // 左孩子比u节点小
    if(u * 2 + 1 <= si && h[u*2 + 1] < h[t]) t = u*2 + 1;
    if(t != u){
        swap(h[t],h[u]);
        down(t);
    }
}

int main(){
     ios::sync_with_stdio(false); cin.tie(0);
    cin >> n >> m; // n个整数，输出前m个数
    for(int i = 1; i <= n; i++) cin >> h[i];
    si = n;
    for(int i = n/2; i >= 1; i--) down(i); //建堆
    while(m--){
        cout << h[1] << " ";
        h[1] = h[si]; // 最后一节点覆盖一个节点，down(1);
        si--;
        down(1);
    }

    return 0;
}

二分 lower_bound upper_bound

int binary_search(int a[],int l,int r,int target){
    while(l <= r){
        int mid = l + (r-l)/2;
        if(a[mid] == target) return mid;
        if(target > a[mid]) l = mid + 1;
        else r = mid - 1;
    }
    return -1;
}
int lower_bound(int a[],int l,int r,int target){
    int index = r + 1;
    while(l <= r){
        int mid = l + (r-l)/2;
        if(target > a[mid]) l = mid + 1;
        else{
            index = mid;
            r = mid - 1;
        }
    }
    return index;
}
int upper_bound(int a[],int l,int r,int target){
    int index = r + 1;
    while(l <= r){
        int mid = l + (r-l)/2;
        if(target >= a[mid]) l = mid + 1;
        else{
            index = mid;
            r = mid - 1;
        }
    }
    return index;
}

树状数组

#include <iostream>
using namespace  std;

const int N = 500010;
int c[N];
int n,m;

int lowbit(int i){
    return i & (-i);
}
void add(int i,int k){
    for(; i <= n; i += lowbit(i)){
        c[i] += k;
    }
}
int sum(int i){
    int s = 0;
    for(; i > 0; i -= lowbit(i)){
        s += c[i];
    }
    return s;
}

int main(){
    cin >> n >> m;
    for(int i = 1; i <= n; i++){
        int t; cin >> t;
        add(i,t);
    }
    while(m--){
        int op; cin >> op;
        if(op == 1){
            int x,k; cin >> x >> k;
            add(x,k);
        }else{
            int l,r; cin >> l >> r;
            cout << sum(r) - sum(l-1) << endl;
        }
    }
    return 0;
}
}

gcd

    public int gcd(int a,int b){
        if(b == 0) return a;
        return gcd(b,a%b);
    }

并查集

#include <iostream>
using namespace std;
const int N = 100010;
int fa[N];
int n,m;

int get(int x){
	if(x == fa[x]) return x;
    fa[x] = get(fa[x]);
    return fa[x];
}

void merge(int a,int b){
	fa[get(a)] = get(b);
}



int main(){
	cin >> n >> m;
	for(int i = 1; i <= n; i++) fa[i] = i;
	while(m--){
		char op; cin >> op;
		int a,b;
		if(op == 'M'){
			cin >> a >> b;
			merge(a,b);

		}else{
			cin >> a >> b;
			if(get(a) == get(b)) cout << "Yes" << endl;
			else cout << "No" << endl;
		}
	}
	return 0;

}
}