摘要:
ParencodingsTime Limit:1000MSMemory Limit:10000KTotal Submissions:17819Accepted:10715DescriptionLet 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 right p 阅读全文
posted @ 2013-10-31 18:59
程序猿猿猿
阅读(172)
评论(0)
推荐(0)