uva 348

dp还是比较容易  关键是输出路径 ....

#include <cstdlib>
#include <cstdio>
#include <cstring>
#define inf 0x7fffffff
using namespace std;
int n;
struct cc
{
    int a;
    int b;
    void f(int x, int y)
    {
        a = x;
        b = y;
    }
};
cc m[105];
int dp[105][105];
int path[105][105];

int DP(int l, int r)
{
    if(dp[l][r] != 0)
        return dp[l][r];
    if(l+1 == r)
    {
        dp[l][r] = m[l].a*m[l].b*m[r].b;
        return dp[l][r];
    }
    if(l == r)
        return 0;
    int mins = inf;
    for(int i = l; i < r; i++)
    {
        int t = DP(l, i) + DP(i+1, r) + m[l].a*m[i].b*m[r].b;
        if(t < mins)
        {
            mins = t;
            path[l][r] = i;
        }
    }
    dp[l][r] = mins;
    return mins;
}
void print(int l, int r)
{
    if(l == r)
    {
        printf("A%d",r);
        return;
    }
    if(l+1 == r)
    {
        printf("(A%d x A%d)",l,r);
        return;
    }
    printf("(");
    print(l, path[l][r]);
    printf(" x ");
    print(path[l][r]+1, r);
    printf(")");
}
int main()
{
    int ca = 1;
    while(scanf("%d",&n) == 1 && n)
    {
        for(int i = 1; i <= n; i++)
            {
                int x, y;
                scanf("%d %d",&x,&y);
                m[i].f(x, y);
            }
        memset(dp, 0, sizeof(dp));
        memset(path, 0, sizeof(path));
        DP(1,n);
        printf("Case %d: ", ca++);
        print(1,n);
        puts("");
    }
    return 0;
}