随笔分类 -  POJ Solutions

Solutions to problems on http://poj.org/problemlist.
[POJ] Brackets Sequence
摘要：This problem can be solved elegantly using dynamic programming.We maintain two arrays:cnt[i][j] --- number of parentheses needed to add within s[i..j]... 阅读全文
posted @ 2015-06-22 17:58 jianchao-li 阅读(219) 评论(0) 推荐(0) 编辑