题目链接:【E. Sereja and Brackets】 线段树
输入一串括号串,m次询问,每次输出区间[l,r]之间配对的括号最多是多少
配对的括号是‘()’,除此之外全不是配对的
a[i]表示到i为止一共有多少括号对
b[i]表示到i为止有多少‘(’没有配对
先遍历一遍,记录数组a,b,那么区间[l,r]的括号对数就是a[r] - a[l-1] - num
num就是在'('在[1,l-1]间没有配对,但是在[l,r]之间被配对了,所以num = b[l-1] - min(b[l]~b[r])
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <string>
using namespace std;
#define inf 1000005
char s[inf];
int len;
int a[inf], b[inf];
struct node
{
int l, r, minx;
}t[inf*4];
int build(int left, int right, int u)
{
t[u].l = left, t[u].r = right;
if(left == right) return t[u].minx = b[left];
int mid = (left + right) >> 1;
return t[u].minx = min(build(left, mid, u<<1), build(mid+1, right, (u<<1)+1));
}
int query(int li, int ri, int u)
{
if(t[u].l == li && t[u].r == ri) return t[u].minx;
int mid = (t[u].l+t[u].r)>>1;
if(li<=mid && mid<ri) return min(query(li,mid,u<<1),query(mid+1,ri,(u<<1)+1));
else if(mid>=ri) return query(li, ri, u<<1);
else return query(li, ri, (u<<1)+1);
}
int main()
{
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
scanf("%s", s+1);
len = strlen(s+1);
int tmp = 0;
for(int i = 1; i <= len; i++)
{
a[i] = a[i-1];
if(s[i] == '(') tmp++;
else if(tmp)
{
a[i]++;
tmp--;
}
b[i] = tmp;
}
build(1, len, 1);
int m;
scanf("%d", &m);
for(int i = 0; i < m; i++)
{
int li, ri;
scanf("%d%d", &li, &ri);
int num = a[ri] - a[li-1] - max(b[li-1]-query(li, ri, 1), 0);
printf("%d\n", num*2);
}
return 0;
}