UVa442
来源:互联网 发布:arcgis api for js 编辑:程序博客网 时间:2024/05/22 08:14
/*
典型的表达式解析题目
解析表达式一般是使用栈实现的
*/
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<set>
#include<string.h>
#include<math.h>
#include<queue>
#include<stack>
#include<unordered_map>
using namespace std;
int main(){
char s[5];
int N,row,col;
pair<int,int>m[30];
scanf("%d",&N);
for(int i=0;i<N;++i){
scanf("%s%d%d",&(s[0]),&row,&col);
m[s[0]-'A']=make_pair(row,col);
}
while(scanf("%s",s)!=EOF){
int n=strlen(s),ans=0,flag=1;
stack<pair<int,int>>sk;
for(int i=0;i<n;++i){
if(isalpha(s[i]))sk.push(m[s[i]-'A']);
else if(s[i]==')'){
auto rhs=sk.top();sk.pop();
auto lhs=sk.top();sk.pop();
if(lhs.second!=rhs.first){flag=0;break;}
else{
ans+=lhs.first*lhs.second*rhs.second;
lhs.second=rhs.second;
sk.push(lhs);
}
}else continue;
}
if(flag)printf("%d\n",ans);
else printf("error\n");
}
return 0;
}
阅读全文
0 0
- UVA442
- uva442
- UVA442
- UVa442
- uva442
- uva442
- uva442
- UVa442
- UVa442
- UVa442
- UVa442
- uva442 栈
- UVA442栈
- uva442 Matrix Chain Multiplication
- uva442 Matrix Chain Multiplication
- uva442-矩阵链乘
- uva442-Matrix Chain Multiplication
- UVA442 Matrix Chain Multiplication
- leetcode No236. Lowest Common Ancestor of a Binary Tree
- Vue2+VueRouter2+webpack 构建项目实战(三)配置路由,整俩页面先
- MySQL server version for the right syntax to use near ';) T' at line 7
- Leetcode 338. Counting Bits
- [Leetcode] 216. Combination Sum III 解题报告
- UVa442
- JDBC
- ASM AMDU工具使用
- 半路出家, 我的iOS自学之路-2-头文件, 属性, 引用计数, 协议, 类别, 类扩展
- async异步问题(waterfall、parallel、eachSeries、map、whilst)
- cglib动态代理实现
- Contest_5 0614 By lhq
- gulp-删除文件和文件夹
- 基本数据类型