动态规划－代码（1）

最大字串和

0／1背包问题

矩阵相乘

#include <stdlib.h>
#include <stdio.h>
#include <vector>
#include <string>

#define MAX_SIZE 9
using namespace std;

void max_sequence()
{
    int array[MAX_SIZE] = {1, 6, -3, 4, -2, 9, 0, -8, 5};
    int max = array[0];
    int f[MAX_SIZE] = {0};
    f[0] = array[0];
    for (int i = 1; i < MAX_SIZE - 1; i++) {
        f[i] = array[i] > (f[i - 1] + array[i]) ? array[i] : f[i - 1] + array[i];
        if (f[i] > max) {
            max = f[i];
        }
    }
    printf("%d\n", max);
    return;
}

void knapsack()
{
    int c[5] = {3, 5, 2, 7, 4};
    int v[5] = {2, 4, 1, 6, 5};
    int f[5][10] = {0};  //max 9
    for (int i = 0; i < 10; i++) {
        if (c[0] <= i) {
            f[0][i] = v[0];
        }
    }
    for (int i = 1; i < 5; i++) {
        for (int j = 0; j < 10; j++) {
            if (c[i] <= j) {
                f[i][j] = f[i - 1][j] > (f[i - 1][j - c[i]] + v[i]) ? f[i - 1][j] : (f[i - 1][j - c[i]] + v[i]);
            } else {
                f[i][j] = f[i - 1][j];
            }
        }
    }
    printf("%d\n", f[4][9]);
    return;
}

void min_multiple()
{
    int m[4][4] = {0};
    int min = 0;
    int r[4] = {10, 100, 5, 50};  // three metric
    for (int l = 1; l < 3; l++) {
        for (int i = 1; i < 4 - l; i++) {
            int j = i + l;
            min = m[i][i] + m[i + 1][j] + r[i - 1] * r[i] * r[j];
            for (int k = i + 1; k < j; k++) {
                if (m[i][k] + m[k + 1][j] + r[i - 1] * r[k] * r[j] < min) {
                    min = m[i][k] + m[k + 1][j] + r[i - 1] * r[k] * r[j];
                }
            }
            m[i][j] = min;
        }
    }
    printf("%d\n", m[1][3]);
}

int main()
{
    max_sequence();
    knapsack();
    min_multiple();
    return 0;
}