CF 223A Bracket Sequence

题目链接:http://codeforces.com/problemset/problem/223/A

题目大意:

给定一串只含有' ( ',' ) ', ' [ ' , ' ] '的括号表达式,求其子串中的正确表达式中的含' [ '最多的任意子串.

题目思路:

这题让我对表达式的解析有更进一步的了解,很容易想到由单个的" () "或" [] "开始去扩展出一个正确表达式,但是麻烦就麻烦在怎么去扩展,当然如果对表达式有比较深刻的理解就比较容易了,我是用广搜的方法,由单个匹配向多个匹配扩出去的.

设s和x为正确表达式子串.

扩展时会碰到如下情况:

(s)或[s],这个很容易理解和实现.

xs或sx,这个需要自己琢磨一下怎么实现,也简单的.

代码:

#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;

//#define ll __int64
#define ll long long
#define ls rt<<1
#define rs ls|1
#define lson l,mid,ls
#define rson mid+1,r,rs
#define middle l+r>>1
#define esp (1e-8)
#define type int
#define clr(x,c) memset(x,c,sizeof(x))
#define MOD 1000000007
typedef pair<int,int> pii;

void swap(type &x,type &y){type t=x;x=y;y=t;}
type max(type x,type y){return x>y? x:y;}
type min(type x,type y){return x<y? x:y;}
const int inf=0x3F3F3F3F;
//const double pi=acos(-1.0);
const int M=100000 +5;
int T,cas;

int n,m;
char s[M];
int vis[M],val[M],ans,al,ar;
queue<int>q;

void preSof(){
    return;
}

void push(int l,int r,int c){
    vis[l]=r,vis[r]=l;
    val[l]=val[r]=c;
    q.push(l),q.push(r);
}

void run(){
    int i,j,ans;
    clr(vis,-1);
    while(!q.empty()) q.pop();
    for(n=0;s[n];n++){
        if(s[n]=='(' && s[n+1]==')'){push(n,n+1,0);continue;}
        if(s[n]=='[' && s[n+1]==']'){push(n,n+1,1);continue;}
    }
    if(q.empty()){puts("0");return;}
    for(ans=-1;!q.empty();){
        int l=q.front();q.pop();
        int r=q.front();q.pop();
        if(vis[l]==-1 || vis[r]==-1) continue;
        if(ans<val[l]) ans=val[l],al=l,ar=r;
        if(l>0 && r<n-1){
            if(s[l-1]=='(' && s[r+1]==')'){vis[l]=vis[r]=-1;push(l-1,r+1,val[l]);continue;}
            if(s[l-1]=='[' && s[r+1]==']'){vis[l]=vis[r]=-1;push(l-1,r+1,val[l]+1);continue;}
        }
        if(l>0 && vis[l-1]!=-1){push(vis[l-1],r,val[l-1]+val[l]);vis[l]=vis[l-1]=-1;continue;}
        if(r<n-1 && vis[r+1]!=-1){push(l,vis[r+1],val[r]+val[r+1]);vis[r]=vis[r+1]=-1;continue;}
    }
    s[ar+1]=0;
    printf("%d\n%s\n",ans,s+al);
}

int main(){
    //freopen("1.in","r",stdin);
    //freopen("1.out","w",stdout);
    preSof();
    //run();
    while(~scanf("%s",s)) run();
    //for(scanf("%d",&T),cas=1;cas<=T;cas++) run();
    return 0;
}