Seinfeld(栈模拟)
2016-02-20 15:55
253 查看
Seinfeld
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1624 Accepted Submission(s): 792[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.)
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
}{
{}{}{}
{{{}
---
[align=left]Sample Output[/align]
1. 2
2. 0
3. 1
题解:
在读入的过程中,把相匹配的删除,最后会存在下面三种形态:
1. }}}...
2. {{{...
3. }}}...{{{...
对于每种形态就很容易求了。
题解:
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<cmath> #include<vector> using namespace std; const int INF=0x3f3f3f3f; #define mem(x,y) memset(x,y,sizeof(x)) #define SI(x) scanf("%d",&x) #define PI(x) printf("%d",x) #define SD(x,y) scanf("%lf%lf",&x,&y) #define P_ printf(" ") const int MAXN=2010; int dp[MAXN]; char q[MAXN]; typedef long long LL; int main(){ char s[MAXN]; int kase=0; while(scanf("%s",s),s[0]!='-'){ int top=0; for(int i=0;s[i];i++){ if(top==0||s[i]=='{')q[++top]=s[i]; else if(q[top]=='{'&&s[i]=='}')--top; else q[++top]=s[i]; } // for(int i=1;i<=top;i++)printf("%c",q[i]);puts(""); int ans; if(top==0||q[top]=='}')ans=top/2; else if(q[1]=='{'&&q[top]=='{')ans=top/2; else{ int ans1=0,ans2=0,k=1; while(q[k]=='}')k++; ans1=k-1; ans2=top-k+1; ans=(ans1+1)/2+(ans2+1)/2; } ++kase; printf("%d. %d\n",kase,ans); } return 0; }
相关文章推荐
- html学习要点总结
- JavaScript中的额事件一
- Caffe —— Deep learning in Practice
- css3 animation 中的 steps
- html5的网页在MAC及ipad上按钮无法正常切换的处理
- Css 选择器总结
- 用TypeScipt和AMD模块化理念实现React官方教程(三)静态页面
- jQuery基础1
- Angular2学习笔记.3、通过模板调用Controller事件实现用户输入和显示,UserInput
- javaScript小结(上)
- CSS基础笔记
- 7个CSS单位
- LeetCode 19. Remove Nth Node From End of List 解题报告
- JavaScript应用:Iframe自适应其加载的内容高度
- JavaScript框架编程
- javascript读取xml
- ReactiveCocoa简介6,添加附加操作(Adding side-effects)
- jquery 对象dom 对象互转
- ReactiveCocoa简介五:用信号封装异步API
- ReactiveCocoa简介四,Button的点击事件的实现