题意
对于一个文本编辑器(假设无限长),一开始文本为空,光标在第一个位置,有3种操作:
1.光标左移
2.光标右移
3.将当前位置字符改为指定字符
问输入的字符串是否合法,不合法输出-1,合法输出括号最大层数
题解
将’(‘赋权为1,’)'赋权为-1,其他字符赋权为0,则字符串的权就是所有字符的权值和,用线段树维护字符串权值以及最小前缀和和最大权值和,若字符串权值或最小前缀和不为0,则必定不合法,字符串权值不为0说明括号数目不对等,最小前缀和不为0说明出现了括号不匹配的情况,若合法则答案为最大前缀和
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define _for(i,a,b) for(register int i = a; i < b; ++i)
#define _rep(i,a,b) for(register int i = a; i <= b; ++i)
#define closeIO ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define debug cout << "*****************" << endl
#define FREE freopen("in.txt","r",stdin)
#define FREO freopen("out.txt","w",stdout)
#define ls l, m, rt << 1
#define rs m + 1, r, rt << 1 | 1
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> pii;
typedef long double LD;
const int INF = 0x3f3f3f3f;
const int MAXN = 1e6 + 10;
const int MOD = 1e9 + 7;
const double eps = 1e-3;
const double PI = acos(-1);
int n, Sum[MAXN << 2], Max[MAXN << 2], Min[MAXN << 2];
char s[MAXN];
void PushUp(int rt) {
Sum[rt] = Sum[rt << 1] + Sum[rt << 1 | 1];
Max[rt] = max(Max[rt << 1], Sum[rt << 1] + Max[rt << 1 | 1]);
Min[rt] = min(Min[rt << 1], Sum[rt << 1] + Min[rt << 1 | 1]);
}
void Update(int pos, int val, int l, int r, int rt) {
if (l == r) {
Sum[rt] = Max[rt] = Min[rt] = val;
return;
}
int m = (l + r) >> 1;
if (pos <= m) Update(pos, val, ls);
else Update(pos, val, rs);
PushUp(rt);
}
int main() {
scanf("%d%s", &n, s);
memset(Sum, 0, sizeof(Sum));
memset(Max, 0, sizeof(Max));
memset(Min, 0, sizeof(Min));
int now = 1;
for (int i = 0; i < n; ++i) {
if (s[i] == 'L') now -= now > 1;
else if (s[i] == 'R') ++now;
else if (s[i] == '(') Update(now, 1, 1, n, 1);
else if (s[i] == ')') Update(now, -1, 1, n, 1);
else Update(now, 0, 1, n, 1);
if (Sum[1] != 0 || Min[1] != 0) printf("-1");
else printf("%d", Max[1]);
if (i != n - 1) printf(" ");
}
return 0;
}