题目:
分析:
一眼看出正解但就是打不
A
A
A系列
感觉用了差分思路就很明显了,在左括号的地方
+
1
+1
+1在右括号的后一位
−
1
-1
−1(差分数组)
代码:
#pragma GCC optimize(3)
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<set>
#include<queue>
#include<vector>
#include<map>
#include<list>
#include<ctime>
#include<iomanip>
#include<string>
#include<bitset>
#include<deque>
#include<set>
#define LL long long
#define WYC 1000000007
using namespace std;
inline LL read(){
LL d=0,f=1;char s=getchar();
while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}
while(s>='0'&&s<='9'){d=d*10+s-'0';s=getchar();}
return d*f;
}
LL ans,f[1000005]; char s[1000005];
int n,m,t,w[1000005],l[1000005],r[1000005],cl[1000005],cr[1000005];
void TQL()
{
for(int i=1;i<=n;++i)
if(s[i]=='(') w[++t]=i;
else if(t) r[w[t]]=i+1,l[i+1]=w[t--];
for(int i=n+1;i;--i) cr[l[i]]+=++cr[i];
for(int i=1;i<=n;++i) cl[r[i]]+=--cl[i];
for(int i=1;i<=n;++i) f[i]=f[i-1]+cl[i]+cr[i];
for(int i=1;i<=n;++i) ans=ans+i*f[i]%WYC;
return;
}
int main(){
int q=read();
while(q--)
{
memset(f,0,sizeof(f));
memset(l,0,sizeof(l));
memset(r,0,sizeof(r));
memset(cl,0,sizeof(cl));
memset(cr,0,sizeof(cr));
scanf("%s",s+1); n=strlen(s+1);
t=ans=0;
TQL();
printf("%lld\n",ans);
}
return 0;
}