HDU3351 Seinfeld 【贪心】
来源:互联网 发布:ubuntu 拨号 编辑:程序博客网 时间:2024/05/16 00:46
Seinfeld
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1368 Accepted Submission(s): 674
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
Source
2009 ANARC
题意:给定一个括号序列,求最少经过多少操作能使其变为合法序列,操作只能是把左括号变为右括号或者右括号变为左括号。
题解:每次读取一个字符,若是左括号,那么left++,若是右括号,那么left--,若left==0,那么需要一次操作以将右括号变为左括号。
#include <stdio.h>#include <string.h>#define maxn 2010char str[maxn];int main() {int i, left, op, cas = 1;while(scanf("%s", str), str[0] != '-') {left = op = 0;for(i = 0; str[i]; ++i) {if(str[i] == '{') ++left;else if(0 == left) {++left; ++op;} else --left;}op += left / 2;printf("%d. %d\n", cas++, op);}return 0;}
0 0
- HDU3351 Seinfeld 【贪心】
- HDU3351 -Seinfeld
- HDU 3351 Seinfeld【贪心、栈】
- Seinfeld
- Seinfeld
- Seinfeld
- Seinfeld
- 杭电3351 Seinfeld(贪心)
- HDU3351 动态规划,经验总结
- HDU_3351 Seinfeld
- POJ 3991 Seinfeld
- 杭电 Seinfeld
- hdu-oj 3351 Seinfeld
- Seinfeld(杭电3351)
- 1410282310-hd-Seinfeld
- Seinfeld杭电3351
- HDU 3351 Seinfeld
- POJ 3991 Seinfeld
- CString 字符串的连接
- [Android]Can't create handler inside thread that has not called Looper.prepare()
- 第二章线性表总结(包括知识总结导图)
- 第四章 4.8节练习
- 人嘛,就那么回事!
- HDU3351 Seinfeld 【贪心】
- hdu 4996 1~n排列LIS值为k个数
- C語言 rand函数 进阶探讨与实现
- 2014 第五届蓝桥杯软件本科A组预赛题解(填空及代码填空)
- collection集合的简单使用
- JAVA正则表达式 Pattern和Matcher
- MyEclipse快捷键大全
- 2-07. 素因子分解(20)
- UVA - 507 - Jill Rides Again (dp最大子段和)