要想使括号匹配，sum数组的值要都大于0
//struct A
//{
// int x,y;
// bool operator < (const A & a) const
// {
// return x>a.x;
// }
//}; //优先队列（按结构体中的x从小到大排序）
//priority_queue <A> q;
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cstdio>
#include <vector>
#include <cmath>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#define eps 0.0000000001
#define read(a) scanf("%d",&a)
#define mem(a) memset(a,0,sizeof(a))
#define maxx 1e10
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
//priority_queue<int,vector<int>,greater<int> > q;
#define mod 1000000007
const int maxn=300100;
set<int> st;
char cs[maxn];
int a[maxn];
int sum[maxn*4];
int Add[maxn*4];