codeforces 508 E. Arthur and Brackets
2015-01-29 17:40
246 查看
codeforces 508 E. Arthur and Brackets
题目链接:
http://codeforces.ru/problemset/problem/508/E
题意:
有n对括号,按顺序,给出每对括号长度的范围,输出一种情况。
限制:
1 <= n <= 600
思路:
贪心:能匹配的先匹配。
括号匹配问题,果断先思考用栈能不能做。
题目链接:
http://codeforces.ru/problemset/problem/508/E
题意:
有n对括号,按顺序,给出每对括号长度的范围,输出一种情况。
限制:
1 <= n <= 600
思路:
贪心:能匹配的先匹配。
括号匹配问题,果断先思考用栈能不能做。
相关文章推荐
- codeforces 508 E. Arthur and Brackets
- Arthur and Brackets - CodeForces 508 E dp贪心
- codeforces288 E. Arthur and Brackets
- Anya and Ghosts - CodeForces 508 C 水题
- codeforces 508 A Pasha and Pixels
- Codeforces--525D--Arthur and Walls(DFS)
- codeforces - 508B - Anton and currency you all know(贪心)
- Codeforces 380C Sereja and Brackets(线段树)
- codeforces 508 B. Anton and currency you all know
- 【Codeforces 629 C Famil Door and Brackets 】+ dp
- 【CodeForces 525D】【dfs+思维】 Arthur and Walls 【只包含点和星的矩阵,需要将部分星变成点使点能组成矩形 】
- CodeForces-629C-Famil Door and Brackets
- Codeforces Round #288 (Div. 2) E. Arthur and Brackets 贪心 区间dp
- 【Henu ACM Round#20 F】 Arthur and Brackets
- Arthur and Walls - CodeForces 525 D 搜索
- Codeforces Round #288 (Div. 2) E. Arthur and Brackets
- codeforces 508 D. Tanya and Password (fleury算法)
- codeforces 508 C. Anya and Ghosts
- Codeforces Round #288 (Div. 2)E. Arthur and Brackets
- Codeforces 552E - Vanya and Brackets (中缀表达式求值)