模擬專題

一、POJ 1068 Parencodings（括號處理） http://poj.org/problem?id=1068 Descriptionios Let 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

>>阅读原文<<