矩阵链乘 UVa-442(使用栈判断矩阵链乘是否合法)

ACM汇总学习:https://blog.csdn.net/weixin_39778570/article/details/83187443
Matrix Chain Multiplication UVA - 442
题目：https://vjudge.net/problem/UVA-442
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<bits/stdc++.h>
#define ll long long
#define fo(i,j,n) for(register int i=j; i<=n; ++i)
using namespace std;

struct Matrix{
	int a,b;
	Matrix(int a=0,int b=0):a(a),b(b){}
}m[26];

int n;
void solve(){
	string s;
	stack<Matrix> st;
	while(cin>>s){
		bool error = false;
		while(!st.empty())st.pop();
		int len = s.length();
		ll ans = 0;
		fo(i,0,len-1){
			if(isalpha(s[i]))st.push(m[s[i]-'A']);
			else if(s[i]==')'){
				Matrix x1 = st.top(); st.pop();  
				Matrix x2 = st.top(); st.pop();
				if(x2.b!=x1.a){  // 栈要注意出来是顺序跟进去的顺序是相反的 
					error = true;
					break;
				}
				ans += x2.a*x2.b*x1.b;
				st.push(Matrix(x2.a,x1.b));
			}
		}
		if(error)puts("error");
		else printf("%lld\n",ans);
	}
}
int main(){
	scanf("%d",&n);
	char c;
	fo(i,0,n-1){
		getchar();
		scanf("%c",&c);
		scanf("%d%d",&m[c-'A'].a,&m[c-'A'].b);
//		cout<<c<<" "<<m[k].a<<" "<<m[k].b<<endl;
	}
	solve();
	return 0;
}