hdu5831 Rikka with Parenthesis II（水）

思路：最优情况下一定交换第一个右括号和最后一个左括号，交换后判断一下即可。 时间复杂度O(n)

注意：我的代码那里n==2的时候都判了no其实是错的，还有n==2并且括号是)(的时候是yes的，数据出水了

#include<bits/stdc++.h>
using namespace std;
char s[100005];

int main()
{
    int T;
	scanf("%d",&T);
	while(T--)
	{
		int n;
		scanf("%d",&n);
        scanf("%s",s);
        int cnt=0;
        bool flag=true;
        for(int i=0;i<n;i++)
        {
            if(s[i]==')')cnt++;
            else cnt--;
            if(cnt>2)flag=false;
        }
        if(cnt)flag=false;
        if(n==2)flag=false;
        if(flag)
			printf("Yes\n");
        else
		   	printf("No\n");
	}
}

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

学军中学