UVA-442 Matrix Chain Multiplication

#include<iostream>
#include<stack>
#include<queue>
#include<map>
#include<memory.h>
#include<cstdlib>
#include<cstdio>
#include<algorithm>
#include<iomanip>
#include<string>
#include<string.h>
using namespace std;
class matrix
{
public:
	int a, b;
	matrix(int x=0, int y=0) :a(x), b(y){}
}Matrix[26];    //最多26个矩阵
int main()
{
	int T = 0;
	cin >> T;
	while (T--)
	{
		string name;
		cin >> name;
		cin>>Matrix[name[0] - 'A'].a;
		cin>>Matrix[name[0] - 'A'].b;
	}
	string str;
	int sum = 0;
	while (cin >> str)
	{
		stack<matrix> s;
		sum = 0;
		int f = 0;
		for (int i = 0;i<str.length(); i++)
		{
			if (str[i] <= 'Z'&&str[i] >= 'A')
				s.push(Matrix[str[i] - 'A']);
			else if (str[i] == ')')
			{
				matrix t1, t2;
				if (!s.empty()){t2 = s.top();s.pop();}
				else continue;    //t1 t2顺序不能搞错
				if (!s.empty()){t1 = s.top();s.pop();}
				else continue;
				if (t1.b != t2.a){ cout << "error" << endl; f = 1; break; }
                   //不能相乘
				else sum += (t1.a*t1.b*t2.b);
				s.push(matrix(t1.a, t2.b));    // 相乘后的矩阵再次入栈
			}
		}
		if (!f)
			cout << sum << endl;

	}
}