摘要：
Matrix Chain MultiplicationTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 1695Accepted: 1090DescriptionSuppose 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 which multiplications are performed is 阅读全文
摘要：
Anagrams by StackTime Limit: 2 Seconds Memory Limit: 65536 KB How can anagrams result from sequences of stack operations? There are two sequences of stack operators which can convert TROT to TORT:[
i i i i o o o o
i o i i o o i o
]
where i stands for Push and o stands for Pop. Your program should, g 阅读全文