poj1068
摘要:
ParencodingsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 18785Accepted: 11320DescriptionLet S = s1 s2...s2n be a well-formed string of parentheses. S can be encoded in two different ways: q By an integer sequence P = p1 p2...pn where pi is the number of left parentheses before the ith ri 阅读全文
posted @ 2014-04-06 20:46 PolarisSherlock 阅读(133) 评论(0) 推荐(0) 编辑