HDU 5831 Rikka with Parenthesis II (括号匹配)
来源:互联网 发布:linux重启oracle命令 编辑:程序博客网 时间:2024/05/17 08:03
Rikka with Parenthesis II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1609 Accepted Submission(s): 707
Problem Description
As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them:
Correct parentheses sequences can be defined recursively as follows:
1.The empty string "" is a correct sequence.
2.If "X" and "Y" are correct sequences, then "XY" (the concatenation of X and Y) is a correct sequence.
3.If "X" is a correct sequence, then "(X)" is a correct sequence.
Each correct parentheses sequence can be derived using the above rules.
Examples of correct parentheses sequences include "", "()", "()()()", "(()())", and "(((())))".
Now Yuta has a parentheses sequenceS , and he wants Rikka to choose two different position i,j and swap Si,Sj .
Rikka likes correct parentheses sequence. So she wants to know if she can change S to a correct parentheses sequence after this operation.
It is too difficult for Rikka. Can you help her?
Correct parentheses sequences can be defined recursively as follows:
1.The empty string "" is a correct sequence.
2.If "X" and "Y" are correct sequences, then "XY" (the concatenation of X and Y) is a correct sequence.
3.If "X" is a correct sequence, then "(X)" is a correct sequence.
Each correct parentheses sequence can be derived using the above rules.
Examples of correct parentheses sequences include "", "()", "()()()", "(()())", and "(((())))".
Now Yuta has a parentheses sequence
Rikka likes correct parentheses sequence. So she wants to know if she can change S to a correct parentheses sequence after this operation.
It is too difficult for Rikka. Can you help her?
Input
The first line contains a number t(1<=t<=1000), the number of the testcases. And there are no more then 10 testcases with n>100
For each testcase, the first line contains an integers n(1<=n<=100000), the length of S. And the second line contains a string of length S which only contains ‘(’ and ‘)’.
For each testcase, the first line contains an integers n(1<=n<=100000), the length of S. And the second line contains a string of length S which only contains ‘(’ and ‘)’.
Output
For each testcase, print "Yes" or "No" in a line.
Sample Input
34())(4()()6)))(((
Sample Output
YesYesNoHintFor the second sample input, Rikka can choose (1,3) or (2,4) to swap. But do nothing is not allowed.
Author
学军中学
Source
2016 Multi-University Training Contest 8
题意:
给你一个括号串,让你必须交换一次,判断括号串是否匹配。必须!
POINT:
因为必须,所以单独拎出n=2且为()这种情况,显然是No。
我把左右括号不相等的情况也拎了出来,这样感觉比较好写。
其他情况:
如果一开始就是匹配的,交换后还是匹配。
如果一开始不匹配,就让第一个使串不匹配的)和最后一个(交换。这样还是没有匹配的话,就是No,反之Yes。
cnt[]数组是用来判断匹配的。赋值规则为:遇(加1,遇)减1,有小于0的肯定就不匹配了。
交换一次“)” “(”号,那么交换的区间内cnt[]全部加2 即多了一个左括号,少了一个右括号,总加2。若还有小于0的就是匹配不了。
#include <iostream>#include <string.h>#include <stdio.h>#include <stack>#include <algorithm>#include <math.h>using namespace std;#define ll long longconst int N = 100000+4;char s[N];int cnt[N];int main(){ int T; scanf("%d",&T); while(T--) { int now=0; int n; cin>>n; int flag=0; cin>>s; int you=999999; int zuo; int fz=0,fy=0; for(int i=0;i<n;i++) { if(s[i]=='(') { now++; zuo=i; fz++; } else now--,fy++; if(now<0&&!flag) { flag=1; you=i; } cnt[i]=now; } int ans=1; if(fz!=fy) ans=0; for(int i=you;ans&&i<=zuo;i++) { if(cnt[i]+2<0) { ans=0; break; } } if(strlen(s)==2&&s[0]=='('&&s[1]==')') printf("No\n"); else if(!ans) printf("No\n"); else printf("Yes\n"); } }
阅读全文
0 0
- HDU-5831-Rikka with Parenthesis II-括号匹配
- HDU 5831 Rikka with Parenthesis II (括号匹配)
- hdu 5831 Rikka with Parenthesis II (可交换位置括号匹配)
- 贪心,括号序列(Rikka with Parenthesis II,HDU 5831)
- hdu 5831 Rikka with Parenthesis II【水题】
- HDU 5831 Rikka with Parenthesis II
- hdu 5831 (Rikka with Parenthesis II)
- HDU 5831 Rikka with Parenthesis II
- HDU 5831 Rikka with Parenthesis II
- HDU 5831 Rikka with Parenthesis II
- HDU 5831Rikka with Parenthesis II
- hdu 5831 Rikka with Parenthesis II
- HDU 5831 Rikka with Parenthesis II 【贪心】
- hdu 5831 Rikka with Parenthesis II
- HDU 5831 Rikka with Parenthesis II (栈&思维)
- HDU 5831 Rikka with Parenthesis II(栈的使用)
- [HDU 5831] Rikka with Parenthesis II (实现)
- HDU 5831 Rikka with Parenthesis II (模拟)
- 基础矩阵与本质矩阵
- POJ 1723 SOLDIERS (水)
- 数据库字段 驼峰风格 互相转换
- 暑期项目开发实训 Day22
- 标识符和数据类型
- HDU 5831 Rikka with Parenthesis II (括号匹配)
- 代码风格规范
- 算法题练习系列之(十三): 月饼
- tomcat 启动失败问题:Server Tomcat v8.0 Server at localhost failed to start.
- 无法将项目和文件的编码格式从UTF-8转为GBK
- LCD的封装
- Spark ML包中的几种归一化方法总结
- springMVC的@RequestParam注解和@PathVariable注解的区别
- imx6设备树pinctrl解析