ZOJ 1276 Optimal Array Multiplication Sequence（矩阵连乘）

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1276

裸的矩阵连乘问题。

#include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
#include<cmath>
using namespace std;

int n;
int p[11];
int m[11][11], s[11][11];

void dp()
{
    for (int i = 1; i <= n; i++)  m[i][i] = 0;
    for (int r = 2; r <= n;r++)
    for (int i = 1; i <= n - r + 1; i++)
    {
        int j = i + r - 1;
        m[i][j] = m[i + 1][j] + p[i - 1] * p[i] * p[j];
        s[i][j] = i;
        for (int k = i + 1; k < j; k++)
        {
            int t = m[i][k] + m[k + 1][j] + p[i - 1] * p[k] * p[j];
            if (t < m[i][j])
            {
                m[i][j] = t;
                s[i][j] = k;
            }
        }
    }
}


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

int main()
{
    //freopen("D:\txt.txt", "r", stdin);
    int kase = 0;
    while (cin >> n&& n)
    {
        for (int i = 1; i <= n; i++)
            cin >> p[i - 1] >> p[i];
        dp();
        cout << "Case " << ++kase << ": ";
        print(1,n);
        cout << endl;
    }
    return 0;
}