ZOJ Problem Set - 1016
摘要：
Parencodings Time Limit: 1 Second Memory Limit: 32768 KB Let S = s1 s2 ... s2n be a well-formed string of parentheses. S can be encoded in two different ways:By an integer sequence P = p1 p2 ... pn ... 阅读全文
posted @ 2010-07-02 14:39 天下之大 阅读(184) 评论(0) 推荐(0) 编辑
