AC代码(括号匹配之后看有多少需要改变的然他们都匹配求改变次数‘(’和‘(’需要一次而‘)’和’(‘需要两次)
#include <bits/stdc++.h>
using namespace std;
int main()
{
stack<char> q;
int t, n, a, b, d;
char c;
scanf("%d",&t);
while(t--)
{
a = 0, b = 0;
while(!q.empty())
q.pop();
scanf("%d",&n);
getchar();
for(int i = 0;i<n;i++)
{
scanf("%c",&c);
if(q.empty())
{
q.push(c);
}
else if(c=='(')
{
q.push(c);
}
else if(c==')')
{
if(q.top()=='(')
{
q.pop();
}
else
q.push(c);
}
}
while(!q.empty())
{
if(q.top()=='(')
{
a++;
q.pop();
}
else if(q.top()==')')
{
b++;
q.pop();
}
}
if(a%2==0&&b%2==0)
printf("%d\n",(a+b)/2);
else
{
d = min(a, b);
a-=d;
b-=d;
printf("%d\n",2*d+(a+b)/2);
}
}
return 0;
}