杭电OJ 5831 Rikka with Parenthesis II

最新推荐文章于 2020-03-07 21:48:36 发布

细水长流者

最新推荐文章于 2020-03-07 21:48:36 发布

阅读量310

点赞数

CC 4.0 BY-SA版权

分类专栏：杭电OJ 文章标签：杭电OJ

本文链接：https://blog.csdn.net/qiaoermeng/article/details/52198180

杭电OJ 专栏收录该内容

14 篇文章

订阅专栏

本文介绍了一个涉及括号序列的编程挑战，目标是通过交换两个位置的元素来判断是否能将错误的括号序列转换为正确的括号序列。文章提供了输入输出示例及解析方法。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Rikka with Parenthesis II

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 603 Accepted Submission(s): 344

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 sequence

S , 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?

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 ‘)’.

Output

For each testcase, print "Yes" or "No" in a line.

Sample Input

  
   3
4
())(
4
()()
6
)))(((

Sample Output

  
   Yes
Yes
No


   
    
     Hint
    
For 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

Recommend

wange2014

以下附上代码：

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<math.h>
#define max(a,b) (a>b?a:b)
using namespace std;
char a[100009];
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n,i;
scanf("%d",&n);
getchar();

scanf("%s",a);
int k=0;
if(strcmp(a,"()")==0)
{
printf("No\n");
}
else
{
for(i=0; i<n; i++)
{
if(a[i]=='(')
{
k++;
}
if(a[i]==')')
{
k--;
}
if(k<-2)
{
break;
}
}
if(k==0)
{
printf("Yes\n");
}
else
{
printf("No\n");
}
}
}
return 0;
}