我也有背模板的一天？

1.快排

#include <iostream>

using namespace std;

const int N = 100010;

int a[N];
int n;

void qs(int q[], int l, int r)
{
    if(l >= r)  return;
    int x = q[l + r >> 1], i = l - 1, j = r + 1;
    while(i < j)
    {
        do i ++; while(q[i] < x);
        do j --; while(q[j] > x);
        if(i < j)   swap(q[i], q[j]);
    }
    
    qs(q, l, j);
    qs(q, j + 1, r);
}

int main()
{
    scanf("%d", &n);
    for(int i = 0; i < n; i ++) scanf("%d", &a[i]);
    
    qs(a, 0, n - 1);
    
    for(int i = 0; i < n; i ++) printf("%d ", a[i]);
    
    return 0;
}

2.归并

void merge_sort(int q[], int l, int r)
{
    if(l >= r)  return;
    int mid = l + r >> 1;
    merge_sort(q, l, mid), merge_sort(q, mid + 1, r);
    
    int k = 0, i = l, j = mid + 1;
    
    while(i <= mid && j <= r)
        if(q[i] < q[j]) tmp[k ++ ] = q[i ++ ];
        else    tmp[k ++ ] = q[j ++ ];
    while(i <= mid) tmp[k ++ ] = q[i ++ ];
    while(j <= r)   tmp[k ++ ] = q[j ++ ];
    
    for(int i = l, j = 0; i <= r; i ++, j ++)
        q[i] = tmp[j];
}

3.二分

while(l < r)
{
    int mid = l + r + 1>> 1;
    if(check()) l = mid;
    else    r = mid - 1;
}

while(l < r)
{
    int mid = l + r >> 1;
    if(check()) r = mid;
    else    l = mid + 1;
}

4.大整数加法

#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

vector<int> add(vector<int> &A, vector<int> &B)
{
    vector<int> C;
    
    int t = 0;
    for(int i = 0; i < A.size() || i < B.size(); i ++)
    {
        if(i < A.size()) t += A[i];
        if(i < B.size()) t += B[i];
        C.push_back(t % 10);
        t /= 10;
    }
    
    if(t > 0)   C.push_back(1);
    
    return C;
}

int main()
{
    string a, b;
    vector<int> A, B;
    
    cin >> a >> b;
    for(int i = a.size() - 1; i >= 0; i --) A.push_back(a[i] - '0');
    for(int i = b.size() - 1; i >= 0; i --) B.push_back(b[i] - '0');
    
    vector<int> C = add(A, B);
    
    for(int i = C.size() - 1; i >= 0; i --) printf("%d", C[i]);
    
    return 0;
}

5.大整数减法

#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

bool check(vector<int> &A, vector<int> &B)
{
    if(A.size() != B.size())
        return A.size() > B.size();
    for(int i = A.size() - 1; i >= 0; i --)
        if(A[i] != B[i])
            return A[i] > B[i];
    return true;
}

vector<int> sub(vector<int> &A, vector<int> &B)
{
    vector<int> C;
    for(int i = 0, t = 0; i < A.size(); i ++)
    {
        t = A[i] - t;
        if(i < B.size())    t -= B[i];
        C.push_back((t + 10) % 10);
        if(t < 0)    t = 1;
        else t = 0;
    }
    
    while(C.size() > 1 && C.back() == 0)    C.pop_back();
    return C;
}

int main()
{
    string a, b;
    cin >> a >> b;
    vector<int> A, B;
    
    for(int i = a.size() - 1; i >= 0; i --)    A.push_back(a[i] - '0');
    for(int i = b.size() - 1; i >= 0; i --)    B.push_back(b[i] - '0');
    
    vector<int> C;
    
    if(check(A, B))
    {
        C = sub(A, B);
        for(int i = C.size() - 1; i >= 0; i --)    printf("%d", C[i]);
    }
    else
    {
        C = sub(B, A);
        printf("-");
        for(int i = C.size() - 1; i >= 0; i --)    printf("%d", C[i]);
    }
    
    return 0;
}

6.前缀和

#include <iostream>
#include <algorithm>

using namespace std;

const int N = 100010;
int a[N];
int n, m, l, r;

int main()
{
    cin >> n >> m;
    for(int i = 1; i <= n; i ++)
    {
        int x;
        cin >> x;
        a[i] = a[i - 1] + x;
    }
    
    while(m --)
    {
        cin >> l >> r;
        cout << a[r] - a[l - 1] << endl;
    }
    
    return 0;
}

7.二位前缀和

#include <iostream>
#include <algorithm>

using namespace std;

const int N = 1010;
int s[N][N];
int q, x1, y1, x2, y2, n, m;

int main()
{
    scanf("%d%d%d", &n, &m, &q);
    for(int i = 1; i <= n; i ++)
        for(int j = 1; j <= m; j ++)
        {
            int a;
            scanf("%d", &a);
            s[i][j] = s[i - 1][j] + s[i][j - 1] + a - s[i - 1][j - 1];
        }
    
    while(q --)
    {
        scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
        printf("%d\n", s[x2][y2] - s[x1 - 1][y2] - s[x2][y1 - 1] + s[x1 - 1][y1 - 1]);
    }
    
    return 0;
}

8.判断是不是质数：

bool isPrime(int x) {
    if (x < 2) {
        return false;
    }
    for (int i = 2; i * i <= x; ++i) {
        if (x % i == 0) {
            return false;
        }
    }
    return true;
}

9、并查集：1、将两个集合合并，2、询问两个元素是否在一个集合中

p[x] 是 X 节点的父节点

#include <iostream>

using namespace std;

const int N = 100010;
int n, m;
int p[N];

int find(int x)
{
    if(p[x] != x)   p[x] = find(p[x]);
    return p[x];
}

int main()
{
    scanf("%d%d", &n, &m);
    for(int i = 0; i < n; i ++) p[i] = i;
    while(m --)
    {
        char op[2];
        int a, b;
        scanf("%s%d%d", op, &a, &b);
        
        if(op[0] == 'M')    p[find(a)] = find(b);
        else
            if(find(a) == find(b))  puts("Yes");
            else    puts("No");
    }
    
    return 0;
}