欢迎访问我的个人网站==》 jiashubing.cn
2012年11月9日
ZOJ 1094 Matrix Chain Multiplication（map函数 模拟）
摘要： Matrix Chain MultiplicationTime Limit: 2 Seconds Memory Limit: 65536 KBMatrix multiplication problem is a typical example of dynamical programming.Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in whi. 阅读全文
posted @ 2012-11-09 14:57 贾树丙 阅读(251) 评论(0) 推荐(0)