442 - Matrix Chain Multiplication

UVA-442(紫书上例题6-3); 点击打开链接

#include <stack>  
#include <cstdio>  
#include <cstring>  
using namespace std;  
  
struct SMatrix {  
    int row;  
    int col;  
    static int count;  
};  
  
int SMatrix::count = 0;  
bool error;  
  
SMatrix mulMatrix(const SMatrix &, const SMatrix &);  
  
int main()  
{  
    SMatrix matrix[26];  
      
    memset(matrix, 0, sizeof(matrix));  
  
    //enter  
    int n;  
    scanf("%d%*c", &n);  
    for (int i = 0; i < n; i++) {  
        char ch;  
        scanf("%c", &ch);  
        scanf("%d%d%*c", &matrix[ch-'A'].row, &matrix[ch-'A'].col);  
    }  
  
    char ch;  
    stack<SMatrix> staMat;  
    error = false;  
    while (scanf("%c", &ch) != EOF) {  
        if (ch == '\n')  {  
            if (error) {  
                printf("error\n");  
            }else {  
                printf("%d\n", SMatrix::count);  
            }  
            SMatrix::count = 0;  
            error = false;  
        }  
  
        if (ch >= 'A' && ch <= 'Z') {  
            staMat.push(matrix[ch-'A']);  
        }  
  
        if (ch == ')' && staMat.size() > 1) {  
            SMatrix left, right, rslt;  
            right = staMat.top();  
            staMat.pop();  
            left  = staMat.top();  
            staMat.pop();  
  
            rslt = mulMatrix(left, right);  
            staMat.push(rslt);  
        }  
    }  
  
    return 0;  
}  
  
SMatrix mulMatrix(const SMatrix &left, const SMatrix &right)  
{  
    if (left.col != right.row) {  
        error = true;  
        return left;  
    }else {  
        SMatrix::count += left.row * left.col * right.col;  
    }  
  
    SMatrix rslt;  
    rslt.row = left.row;  
    rslt.col = right.col;  
  
    return rslt;  
}  


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值