hdu 1082 利用栈来处理

最新推荐文章于 2020-02-23 10:20:02 发布

kyoma

最新推荐文章于 2020-02-23 10:20:02 发布

阅读量305

点赞数

分类专栏： ------------解题报告------------- 文章标签： C++ 算法竞赛

本文链接：https://blog.csdn.net/kyoma/article/details/52072796

版权

------------解题报告------------- 专栏收录该内容

208 篇文章 0 订阅

订阅专栏

Problem Description

Matrix multiplication problem is a typical example of dynamical programming.

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

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 (1 <= n <= 26), 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

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

计算题中给出的矩阵计算式要做几次乘法，对于两个矩阵A（有r1行，c1列），B（有r2行，c2列），它们能做乘法的首要条件是c1=＝r2。

两矩阵相乘的次数为r1*c1*c2

这题利用栈的性质就特别好做

贴代码：

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <map>
#include <stack>
using namespace std;
struct unit{
    long long r;
    long long c;
};
unit letter[30];
int main(){
    long long n,r,c;
    char a;
    string in;
    scanf("%lld",&n);
    while(n--){
        scanf("%s%lld%lld",&a,&r,&c);
        letter[a-'A'].r=r;
        letter[a-'A'].c=c;
    }
    while(cin>>in){
        long long result=0;
        stack<unit> save;
        unit t1,t2,t;
        char *p=&in[0];
        while(*p!='\0'){
            if('A'<=*p&&*p<='Z'){
                save.push(letter[*p-'A']);
            }
            if(*p==')'){
                t2=save.top();
                save.pop();
                
                t1=save.top();
                save.pop();
                
                if(t1.c!=t2.r){
                    printf("error\n");
                    break;
                }else{
                    result += (t1.r*t2.c*t1.c);
                    t.r=t1.r;
                    t.c=t2.c;
                    save.push(t);
                }
            }
            p++;
        }
        
        if(*p=='\0'){
            printf("%lld\n",result);
        }
    }
    return 0;
}