POJ 3991 Seinfeld
来源:互联网 发布:数据库施伯乐课后答案 编辑:程序博客网 时间:2024/05/09 16:33
Seinfeld
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 897 Accepted: 440
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:
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:
- An empty string is stable.
- If S is stable, then {S} is also stable.
- 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.
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.
Sample Input
}{{}{}{}{{{}---
Sample Output
1. 22. 03. 1
Source
anarc 2009
这题很水,不涉及任何算法,只需把握这个规律:从左往右扫一遍,左括号一定比右括号多,或相等。如果不是把右括号变为左括号。
#include <iostream>#include <string>#include <cmath>using namespace std;string st;int casen=0;void computing(){if(st.length()<=0){cout<<casen<<". 0"<<endl;return;}int len=st.length(),c=0,ans=0;for(int i=0;i<len;i++){if(st[i]=='{') c++;if(st[i]=='}') c--;if(c<0){ans++;st[i]='{';i--;c++;}}cout<<casen<<". "<<ans+c/2<<endl;}int main(){while(getline(cin,st)){casen++;if(st.length()>0 && st[0]=='-') break;computing();}return 0;}
- POJ 3991 Seinfeld
- POJ 3991 Seinfeld
- POJ 3991 Seinfeld
- hdu 3351 Seinfeld / poj 3991 括号匹配2
- POJ 3991 Seinfeld 已被翻译 得思考
- Seinfeld
- Seinfeld
- Seinfeld
- Seinfeld
- HDU_3351 Seinfeld
- HDU3351 -Seinfeld
- 杭电 Seinfeld
- HDU3351 Seinfeld 【贪心】
- hdu-oj 3351 Seinfeld
- Seinfeld(杭电3351)
- 1410282310-hd-Seinfeld
- Seinfeld杭电3351
- HDU 3351 Seinfeld
- 面试题:编写一个将十进制数转换为任意进制的算法或函数
- 黑马程序员:JDBC学习笔记
- mysql 触发器使用实例(修改一个表内容的同时另一个表内容自动变化)
- 公司ASA5520设置实例及说明
- 将gdal源码转化为VS工程编译过程记录
- POJ 3991 Seinfeld
- YII 运行示意图
- Python源码学习之初始化(三)-PyDictObject的初始化
- memset 函数
- 2013 长沙网络赛 B 题 Bizarre Routine
- 新浪微博技术架构分析-转载
- mac bash shell下的javac命令乱码
- Google面试题之战胜股市
- Could not initialize the application's security component