Seinfeld
来源:互联网 发布:手机视频合成软件 编辑:程序博客网 时间:2024/05/25 23:25
Seinfeld
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 284 Accepted Submission(s): 173
Problem Description
I’m out of stories. For years I’ve been writing stories, some rather silly, just to make simple problems look difficult and complex problems look easy. But, alas, not for this one.
You’re given a non empty string made in its entirety from opening and closing braces. Your task is to find the minimum number of “operations” needed to make the string stable. The definition for being stable is as follows:
1. An empty string is stable.
2. If S is stable, then {S} is also stable.
3. If S and T are both stable, then ST (the concatenation of the two) is also stable.
All of these strings are stable: {}, {}{}, and {{}{}}; But none of these: }{, {{}{, nor {}{.
The only operation allowed on the string is to replace an opening brace with a closing brace, or visa-versa.
You’re given a non empty string made in its entirety from opening and closing braces. Your task is to find the minimum number of “operations” needed to make the string stable. The definition for being stable is as follows:
1. An empty string is stable.
2. If S is stable, then {S} is also stable.
3. If S and T are both stable, then ST (the concatenation of the two) is also stable.
All of these strings are stable: {}, {}{}, and {{}{}}; But none of these: }{, {{}{, nor {}{.
The only operation allowed on the string is to replace an opening brace with a closing brace, or visa-versa.
Input
Your program will be tested on one or more data sets. Each data set is described on a single line. The line is a non-empty string of opening and closing braces and nothing else. No string has more than 2000 braces. All sequences are of even length.
The last line of the input is made of one or more ’-’ (minus signs.)
The last line of the input is made of one or more ’-’ (minus signs.)
Output
For each test case, print the following line:
k. N
Where k is the test case number (starting at one,) and N is the minimum number of operations needed to convert the given string into a balanced one.
Note: There is a blank space before N.
k. N
Where k is the test case number (starting at one,) and N is the minimum number of operations needed to convert the given string into a balanced one.
Note: There is a blank space before N.
Sample Input
}{{}{}{}{{{}---
Sample Output
1. 22. 03. 1
栈的模拟,
- Seinfeld
- Seinfeld
- Seinfeld
- Seinfeld
- HDU_3351 Seinfeld
- HDU3351 -Seinfeld
- POJ 3991 Seinfeld
- 杭电 Seinfeld
- HDU3351 Seinfeld 【贪心】
- hdu-oj 3351 Seinfeld
- Seinfeld(杭电3351)
- 1410282310-hd-Seinfeld
- Seinfeld杭电3351
- HDU 3351 Seinfeld
- POJ 3991 Seinfeld
- POJ 3991 Seinfeld
- hdoj 3351 Seinfeld(括号配对)
- HDU 3351 Seinfeld【贪心、栈】
- Java高级编程-网络编程详解 (3)
- ASP.Net 2.0 发送邮件的代码
- VS2008 中 运使用程序正常初始化(0xc000007b)失败
- 3.6.2 每张表一个类层次
- 搜狗云输入法 使用心得
- Seinfeld
- No.9
- Java高级编程-网络编程详解 (4)
- poj 1015 Jury Compromise 动态规划
- Web Browser控件的属性与事件
- aix用命令查监听端口对应的进程
- DriverManager.getConnection(url_String, user_String, password_String)活动图
- hadows
- c中宏定义的特殊符号