NYOJ 括号匹配(二)(区间dp)

描述     给你一个字符串,里面只包含"(",")","[","]"四种符号,请问你需要至少添加多少个括号才能使这些括号匹配起来。     如:     []是匹配的     ([])[]是匹配的     ...

2016-12-31 17:02:53

阅读数:186

评论数:0

HDU 1533Going Home(费用流)

Going Home Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4797    Accepted Submission(s): ...

2016-12-31 11:12:21

阅读数:169

评论数:0

codeforces 742B - Arpa’s obvious problem and Mehrdad’s terrible solution

B. Arpa’s obvious problem and Mehrdad’s terrible solution time limit per test 1 second memory limit per test 256 megabytes input st...

2016-12-14 20:59:39

阅读数:250

评论数:0

codeforces 735B - Urbanization

Local authorities have heard a lot about combinatorial abilities of Ostap Bender so they decided to ask his help in the question of urbanization. The...

2016-12-04 10:53:58

阅读数:211

评论数:0

FOJ Problem 2218 Simple String Problem

Problem Description Recently, you have found your interest in string theory. Here is an interesting question about strings. You are given a strin...

2016-12-03 23:58:29

阅读数:181

评论数:0

蓝桥网 格子刷油漆

X国的一段古城墙的顶端可以看成 2*N个格子组成的矩形(如下图所示),现需要把这些格子刷上保护漆。 你可以从任意一个格子刷起,刷完一格,可以移动到和它相邻的格子(对角相邻也算数),但不能移动到较远的格子(因为油漆未干不能踩!)   比如:a d b c e f 就是合格的刷漆顺...

2016-12-01 13:04:39

阅读数:180

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭