POJ 3991 Seinfeld
来源:互联网 发布:淘宝店9.9包邮 编辑:程序博客网 时间:2024/05/20 13:09
Seinfeld
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 1285 Accepted: 599
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:
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.)
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.
Sample Input
}{
{}{}{}
{{{}
Sample Output
- 2
- 0
- 1
#include <iostream>#include <string.h>#include <stdlib.h>#include <iostream>#include <algorithm>#include <stdio.h>using namespace std;char a[2005];char b[2005];int top;int main(){ int cas=0; while(scanf("%s",a)!=EOF) { if(a[0]=='-') break; int len=strlen(a); top=-1; int ans=0; for(int i=0;i<len;i++) { if(a[i]=='{') b[++top]=a[i]; else { if(top==-1) { b[++top]='{'; ans++; } else { if(b[top]=='{') top--; } } } ans+=(top+1)/2; printf("%d. %d\n",++cas,ans); } 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
- Windows下Mysql错误ERROR 1045 (28000) ERROR 1054 (42S22)以及ERROR 1820 (HY000)的解决
- js开始时间、结束时间比较
- Android Studio使用教程(一)
- 设计模式:适配器模式
- Shell基础(二):Bash变量
- POJ 3991 Seinfeld
- js获取当前系统时间 && js获取当前系统时间-24小时 && 当前系统时间+24小时
- phpstorm中$_post无法传值的问题 与文件无法上传问题
- 137.View the Exhibits and examine PRODUCTS and SALES tables.
- opencl:cl::make_kernel的进化
- Pycharm中的中文文件名只能显示口口口口口口口口口的解决方法
- JDK常用的package
- C#读取文本文件
- JavaScript DOM 操作总结