括号画家 Page90 栈
从前往后遍历,会出现以下两种情况:
1.对于任何的
′
(
′
,
′
[
′
,
′
{
′
'(','[','\{'
′(′,′[′,′{′,只能与后面的元素匹配,故直接入栈
2.对于任何的
′
)
′
,
′
]
′
,
′
}
′
')',']','\}'
′)′,′]′,′}′,只能与栈顶匹配,若匹配成功,则出栈,若匹配不上,则当前元素入栈。
根据定义,只要 o k [ i ] ok[i] ok[i]连续标记的地方,合起来一定是一段美丽的括号,不断更新答案即可
代码:
#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<queue>
#include<map>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define rep(x,a,b) for (int x=a;x<=b;x++)
#define repp(x,a,b) for (int x=a;x<b;x++)
#define W(x) printf("%d\n",x)
#define WW(x) printf("%lld\n",x)
#define pi 3.14159265358979323846
#define mem(a,x) memset(a,x,sizeof a)
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
using namespace std;
const int maxn=2e6+7;
const int INF=1e9;
const ll INFF=1e18;
struct node
{
int pos,x;
}tmp;
stack<node> S;
bool ok[maxn];
char s[maxn];
int main()
{
scanf("%s",s);mem(ok,false);
int n=strlen(s);
rep(i,0,n-1)
{
tmp.pos=i;
if (s[i]=='(')tmp.x=1,S.push(tmp);
else if (s[i]=='[')tmp.x=2,S.push(tmp);
else if (s[i]=='{')tmp.x=3,S.push(tmp);
else
{
if (s[i]==')')tmp.x=4;
if (s[i]==']')tmp.x=5;
if (s[i]=='}')tmp.x=6;
if (S.empty())S.push(tmp);
else
{
if (S.top().x==tmp.x-3)
{
ok[i]=true;ok[S.top().pos]=true;
S.pop();
}
else S.push(tmp);
}
}
}
int i=0,len=0,ans=0;
while(i<n)
{
if (ok[i]==true)
{
while(ok[i+len]==true&&i+len<n)len++;
ans=max(ans,len);
i+=len;
}
else i++,len=0;
}
W(ans);
return 0;
}