随笔分类 -  acm--模拟

poj 1068 -- Parencodings
摘要：ParencodingsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 19068Accepted: 11503DescriptionLet S = s1 s2...s2n be a well-formed string of par... 阅读全文
posted @ 2014-05-23 14:14 ZeroCode_1337 阅读(137) 评论(0) 推荐(0)