zoukankan      html  css  js  c++  java
  • Uva442 Matrix Chain Multiplication

    Matrix Chain Multiplication

    Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary. However, the number of elementary multiplications needed strongly depends on the evaluation order you choose.

    For example, let A be a 50*10 matrix, B a 10*20 matrix and C a 20*5 matrix. There are two different strategies to compute A*B*C, namely (A*B)*C and A*(B*C).

    The first one takes 15000 elementary multiplications, but the second one only 3500.

    Your job is to write a program that determines the number of elementary multiplications needed for a given evaluation strategy.

    Input Specification

    Input consists of two parts: a list of matrices and a list of expressions.

    The first line of the input file contains one integer n ( tex2html_wrap_inline28 ), representing the number of matrices in the first part. The next n lines each contain one capital letter, specifying the name of the matrix, and two integers, specifying the number of rows and columns of the matrix.

    The second part of the input file strictly adheres to the following syntax (given in EBNF):

    SecondPart = Line { Line } <EOF>
    Line       = Expression <CR>
    Expression = Matrix | "(" Expression Expression ")"
    Matrix     = "A" | "B" | "C" | ... | "X" | "Y" | "Z"

    Output Specification

    For each expression found in the second part of the input file, print one line containing the word "error" if evaluation of the expression leads to an error due to non-matching matrices. Otherwise print one line containing the number of elementary multiplications needed to evaluate the expression in the way specified by the parentheses.

    Sample Input

    9
    A 50 10
    B 10 20
    C 20 5
    D 30 35
    E 35 15
    F 15 5
    G 5 10
    H 10 20
    I 20 25
    A
    B
    C
    (AA)
    (AB)
    (AC)
    (A(BC))
    ((AB)C)
    (((((DE)F)G)H)I)
    (D(E(F(G(HI)))))
    ((D(EF))((GH)I))

    Sample Output

    0
    0
    0
    error
    10000
    error
    3500
    15000
    40500
    47500
    15125
    分析:其实就是表达式求值问题,我们用栈来处理,当遇到字母的时候入栈,否则当遇到右括号再处理,因为每一对括号里面最多只会有一次运算.
    #include <cstdio>
    #include <cstring>
    #include <iostream>
    #include <algorithm>
    #include <cmath>
    #include <string>
    #include <stack>
    
    using namespace std;
    string s;
    
    struct node
    {
        int a, b;
    }e[50];
    
    int n,ans;
    bool flag = false;
    stack <node>st;
    
    int main()
    {
        scanf("%d", &n);
        for (int i = 1; i <= n; i++)
        {
            char ch[2];
            int a, b;
            scanf("%s", ch);
            scanf("%d%d", &a, &b);
            e[ch[0] - 'A'].a = a;
            e[ch[0] - 'A'].b = b;
        }
        while (cin >> s)
        {
            flag = false;
            ans = 0;
            for (int i = 0; i < s.size(); i++)
            {
                if (s[i] - 'A' >= 0 && s[i] - 'A' <= 26)
                    st.push(e[s[i] - 'A']);
                else
                    if (s[i] == ')')
                    {
                    node u = st.top();
                    st.pop();
                    node v = st.top();
                    st.pop();
                    if (v.b != u.a)
                    {
                        printf("error
    ");
                        flag = 1;
                        break;
                    }
                    else
                    {
                        ans += v.a * v.b * u.b;
                        node temp;
                        temp.a = v.a;
                        temp.b = u.b;
                        st.push(temp);
                    }
                    }
            }
            if (!flag)
                printf("%d
    ", ans);
        }
    
        return 0;
    }
     
  • 相关阅读:
    Centos7.2 下搭建LNMP环境(终极版)Yum安装
    ThinkPHP3.2 插入数据库数据,缓存问题
    无限极分类的JS实现
    PHP 商城无限极分类
    高速下载Centos的地址
    高性能的城市定位API接口
    阿帕奇配置本地虚拟站点,XAMPP环境下
    Nginx 下配置Laravel 错误404
    laravel Redis缓存
    pytest.1.快速开始
  • 原文地址:https://www.cnblogs.com/zbtrs/p/7568217.html
Copyright © 2011-2022 走看看