第二章 分治法

1.求取最大值与最小值

#include <iostream>
using namespace std;
const int maxn = 1e4 + 100;
int a[maxn];

void fun(int i, int j, int & fmax, int & fmin)
{
    if(i == j) {
        fmax = fmin = a[i];
        return ;   ///书上没有此步，应加此步否则错误。
    }
    if(i == (j - 1)) {
        if(a[i] > a[j]) {
            fmax = a[i];
            fmin = a[j];
        } else {
            fmax = a[j];
            fmin = a[i];
        }
    } else {
        int gmax, gmin, hmax, hmin;
        int mid = (i + j) / 2;
        fun(i, mid, gmax, gmin);
        fun(mid + 1, j, hmax, hmin);
        fmax = max(gmax, hmax);
        fmin = min(gmin, hmin);
    }
    return ;
}

int main()
{
    int n;
    cin >> n;
    for(int i = 1; i <= n; ++i) {
        cin >> a[i];
    }
    int fmax, fmin;
    fun(1, n, fmax, fmin);
    cout << fmax << "  " << fmin << endl;
    return 0;
}

2.归并排序

#include <iostream>

using namespace std;
const int INF = 0x3f3f3f3f;
const int maxn = 1e4 + 100;
int a[maxn];
int l[maxn], R[maxn];
int n;

void combine(int a[], int p, int q, int r) {
    int l1 = q - p + 1;
    int l2 = r - q;
    for(int i = 1; i <= l1; ++i) {
        l[i] = a[i + p - 1];
    }
    for(int i = l1 + 1; i <= l1 + l2; ++i) {
        R[i - l1] = a[i + p - 1];
    }
    l[l1 + 1] = INF;
    R[l2 + 1] = INF;
    int i = 1;
    int j = 1;
    for(int k = p; k <= r; ++k) {
        if(l[i] <= R[j]) {
            a[k] = l[i++];
        } else {
            a[k] = R[j++];
        }
    }
}

void sor(int a[], int p, int r) {
    if(p >= r) {
        return ;
    }
    int q = (p + r) / 2;
    sor(a, p, q);
    sor(a, q + 1, r);
    combine(a, p, q, r);
}

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

/*
5
2 5 4 1 2
*/

3.快速排序

#include <iostream>

using namespace std;
const int maxn = 10000;
int a[maxn];
int par(int a[], int p, int r);

void quick_sort(int a[], int p, int r) {
    if(p < r) {
        int q = par(a, p, r);
        quick_sort(a, p, q - 1);
        quick_sort(a, q + 1, r);
    }
}

int par(int a[], int p, int r) {
    int i = p - 1;
    int x = a[r];
    for(int j = p; j <= r - 1; ++j) {
        if(a[j] < x) {
            i++;
            swap(a[i], a[j]);
        }
    }
    swap(a[r], a[i + 1]);
    return i + 1;

}

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

4.斐波那契数列

#include <iostream>

using namespace std;
const int maxn = 1e4;
int f[maxn];

int solve(int n) {
    int t;
    if(f[n] != 0) {
        return f[n];
    }
    if(n == 0) {
        t = 0;
    }
    if(n == 1) {
        t = 1;
    }
    if(n > 1) {
        t = solve(n - 1) + solve(n - 2);
    }
    return f[n] = t;
}

int main()
{
    int n;
    cin >> n;
    solve(n);
    cout << f[n] << endl;
    return 0;
}

5.01背包

#include <iostream>

using namespace std;
const int maxn = 1e3;
int c[maxn][maxn];
int w[maxn];
int v[maxn];
int x[maxn];
int W, n;

void fun() {
    for(int i = 0; i <= W; ++i) {
        c[0][i] = 0;
    }
    for(int i = 1; i <= n; ++i) {
        c[i][0] = 0;
        for(int j = 1; j <= W; ++j) {
            if(w[i] <= j) {
                c[i][j] = max(v[i] + c[i - 1][j - w[i]], c[i - 1][j]);
            } else {
                c[i][j] = c[i - 1][j];
            }
        }
    }
}

void solve(int W) {
    for(int i = n; i >= 2; i--) {
        if(c[i][W] == c[i - 1][W]) {
            x[i] = 0;
        } else {
            x[i] = 1;
            W = W - w[i];
        }
    }
    x[1] = c[1][W] ? 1 : 0;
}

int main()
{
    cin >> n >> W;
    for(int i = 1; i <= n; ++i) {
        cin >> w[i];
    }
    for(int j = 1; j <= n; ++j) {
        cin >> v[j];
    }
    fun();
    solve(W);
    cout << c[n][W] << endl;
    for(int i = 1; i <= n; ++i) {
        cout << x[i] << " ";
    }
    cout << endl;
    return 0;
}

/*
5 17
3 4 7 8 9
4 5 10 11 13
*/

6.矩阵链乘

#include <iostream>

using namespace std;
const int maxn = 10000;
const int INF = 0x3f3f3f3f;
int m[maxn][maxn];
int s[maxn][maxn];
int p[maxn];
int n;

void cal() {
    for(int i = 1; i <= n; ++i) {
        m[i][i] = 0;
    }
    for(int l = 2; l <= n; ++l) {
        for(int i = 1; i <= n - l + 1; ++i) {
            int j = i + l - 1;
            m[i][j] = INF;
            for(int k = i; k <= j - 1; ++k) {
                int temp = m[i][k] + m[k + 1][j] + p[i - 1] * p[k] * p[j];
                if(m[i][j] > temp) {
                    m[i][j] = temp;
                    s[i][j] = k;
                }
            }
        }
    }
}

void fin(int i, int j) {
    if(i == j) {
        cout << i;
    } else {
        cout << "(";
        fin(i, s[i][j]);
        fin(s[i][j] + 1, j);
        cout << ")";
    }
}

int main()
{
    cin >> n;
    for(int i = 0; i <= n; ++i) {
        cin >> p[i];
    }
    cal();
    fin(1, n);
    return 0;
}

/*
5  5 50 100 10 10000 5
6 30 35 15 5 10 20 25
*/