HDU 5831 Rikka with Parenthesis II 【贪心】
来源:互联网 发布:手机天使玻璃优化软件 编辑:程序博客网 时间:2024/05/17 01:13
Rikka with Parenthesis II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1612 Accepted Submission(s): 709
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
#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<queue>#include<stack>#include<vector>#include<map>#include<set>#include<algorithm>using namespace std;#define ll long long#define ms(a,b) memset(a,b,sizeof(a))const int M=1e6+10;const int inf=0x3f3f3f3f;const int mod=1e9+7;int i,j,k,n,m;int sg[M];int vis[M];int gcd,x,y;ll p,q;ll ans;ll sum[M];int a[M];char s[M];int main(){ int t; scanf("%d",&t); while(t--){ scanf("%d",&n); scanf("%s",s); ms(a,0); int sum=0; int sum1=0; int sum2=0; int ans=0; int len=strlen(s); for(int i=0;i<n;i++){ if(s[i]=='('){ a[i]=1,sum1++; sum++; } else { a[i]=-1,sum2++; if(sum>0)sum--; else ans++; } } if(sum1!=sum2)printf("No\n"); else { if(ans>=3)printf("No\n"); else if(len==2&&ans==0)printf("No\n"); else printf("Yes\n"); } } return 0;}
阅读全文
0 0
- 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 2016 Multi-University 8
- HDU-5831-Rikka with Parenthesis II-括号匹配
- HDU.5831 Rikka with Parenthesis II【模拟】【8月13】
- 设计模式中类的关系
- Web应用漏洞评估工具Paros
- 7:----(4) CSS3中的变形--位移 translate()
- Java实现国际化
- 使用wireshark分析加密的WIFI数据包
- HDU 5831 Rikka with Parenthesis II 【贪心】
- Hadoop之初识MapReduce(笔记4)
- MyBatis调用带有返回结果、output参数的存储过程上与ibatis的区别
- 比特币改进协议BIP14(翻译)
- 二分法求最大最小值
- 代理服务器基本认识
- Android学习(十)CheckBox
- EAS8.2,WAF2,打开菜单(列表界面)时进行权限/业务校验
- 7:---(5) 动画