UVA 442 Matrix Chain Multiplication 矩阵链乘

题目链接：https://vjudge.net/problem/UVA-442

题解：本题的关键是利用栈解析矩阵表达式。在求解的过程中，需要注意矩阵乘法的计算方法，行列要求，然后扫描输入表达式即可。

代码：

#include<iostream>
#include<vector>
#include<stack>
#include<cstdio>
#include<string>


using namespace std;


const int maxn = 100 + 10;

struct matrix {
	int row;
	int col;
};

matrix M_table[maxn];

int N;

//symbol (  and  )
matrix left_s = { 1,0 }, right_s = {0,1};


int solve(string statement)
{
	int num = 0;
	stack<matrix> s;
	for (int i = 0; i < statement.size(); i++)
	{
		if (statement[i] == '(') {
			s.push(left_s);
		}
		else if (isalpha(statement[i])) {
			s.push(M_table[statement[i]-'a']);
		}
		else {
			matrix B = s.top(); s.pop();
			matrix A = s.top(); s.pop(); s.pop();

			if (A.col == B.row)
			{
				num += A.row*A.col*B.col;
				matrix C = {A.row,B.col};
				s.push(C);
			}
			else {
				return -1;
			}

		}
	}
	return num;
}

int main() {
	//freopen("input.txt","r",stdin);
	//freopen("output.txt","w",stdout);

	cin >> N;
	for (int i = 0; i < N; i++)
	{
		char ch;
		cin >> ch;
		cin >> M_table[ch - 'a'].row >> M_table[ch - 'a'].col;
	}
	string s;
	while (cin >> s)
	{
		int ans = solve(s);
		if (ans == -1)
			cout << "error" << endl;
		else
			cout << ans << endl;
	}

	return 0;
}