区间dp括号匹配

POJ2955

匹配则加一，不需要初始化

 //#include<bits/stdc++.h>
 #include<iostream>
 #include<cstdio>
 #include<algorithm>
 #include<vector>
 #include<cstring>
 #include<map>
 #include<set>
 #include<queue>
 #include<bitset>
 #include<utility>
 #include<functional>
 #include<iomanip>
 #include<sstream>
 #include<ctime>
 #include<cassert>
 #define a first
 #define b second
 #define mp make_pair
 #define pb push_back
 #define pw(x) (1ll << (x))
 #define sz(x) ((int)(x).size())
 #define all(x) (x).begin(),(x).end()
 #define rep(i,l,r) for(int i=(l);i<(r);i++)
 #define per(i,r,l) for(int i=(r);i>=(l);i--)
 #define FOR(i,l,r) for(int i=(l);i<=(r);i++)
 #define debug1(a)\
 cout << #a << " = " << a << endl;
 #define debug2(a,b)\
 cout << #a << " = " << a << endl;\
 cout << #b << " = " << b << endl;
 #define debug3(a,b,c)   cout << #a << " = " << a << endl;\
 cout << #b << " = " << b << endl;\
 cout << #c << " = " << c << endl;
 #define debug4(a,b,c,d)\
 cout << #a << " = " << a << endl;\
 cout << #b << " = " << b << endl;\
 cout << #c << " = " << c << endl;\
 cout << #d << " = " << d << endl;
 #define debug5(a,b,c,d,e)\
 cout << #a << " = " << a << endl;\
 cout << #b << " = " << b << endl;\
 cout << #c << " = " << c << endl;\
 cout << #d << " = " << d << endl;\
 cout << #e << " = " << e << endl;
 #define eps 1e-9
 #define PIE acos(-1)
 #define cl(a,b) memset(a,b,sizeof(a))
 #define fastio ios::sync_with_stdio(false);cin.tie(0);
 #define lson l , mid , ls
 #define rson mid + 1 , r , rs
 #define ls (rt<<1)
 #define rs (ls|1)
 #define INF 0x3f3f3f3f
 #define lowbit(x) (x&(-x))
 #define sqr(a) a*a
 #define ll long long
 #define vi vector<int>
 #define pii pair<int, int>
 using namespace std;
 //**********************************
 char s[];
 int n;
 int dp[][];
 //**********************************
 bool match(int a,int b)
 {
     char x=s[a],y=s[b];
     return x=='['&&y==']'||x=='('&&y==')';
 }
 void solve()
 {
     FOR(len,,n)FOR(l,,n-len+){
         int r=l+len-;
         dp[l][r]=dp[l+][r-]+match(l,r);
         rep(k,l,r){
             dp[l][r]=max(dp[l][r],dp[l][k]+dp[k+][r]);
         }
     }
     printf("%d\n",dp[][n]<<);
 }
 //**********************************
 int main()
 {
     while(~scanf("%s",s+)&&s[]!='e'){
         n=strlen(s+);
         solve();
     }
     return ;
 }

CF

不匹配加一，注意初始化边界

 //#include<bits/stdc++.h>
 #include<iostream>
 #include<cstdio>
 #include<algorithm>
 #include<vector>
 #include<cstring>
 #include<map>
 #include<set>
 #include<queue>
 #include<bitset>
 #include<utility>
 #include<functional>
 #include<iomanip>
 #include<sstream>
 #include<ctime>
 #include<cassert>
 #define fi first
 #define se second
 #define mp make_pair
 #define pb push_back
 #define pw(x) (1ll << (x))
 #define sz(x) ((int)(x).size())
 #define all(x) (x).begin(),(x).end()
 #define rep(i,l,r) for(int i=(l);i<(r);i++)
 #define per(i,r,l) for(int i=(r);i>=(l);i--)
 #define FOR(i,l,r) for(int i=(l);i<=(r);i++)
 #define debug1(a)\
 cout << #a << " = " << a << endl
 #define debug2(a,b)\
 cout << #a << " = " << a << endl;\
 cout << #b << " = " << b << endl;
 #define debug3(a,b,c)   cout << #a << " = " << a << endl;\
 cout << #b << " = " << b << endl;\
 cout << #c << " = " << c << endl;
 #define debug4(a,b,c,d)\
 cout << #a << " = " << a << endl;\
 cout << #b << " = " << b << endl;\
 cout << #c << " = " << c << endl;\
 cout << #d << " = " << d << endl;
 #define debug5(a,b,c,d,e)\
 cout << #a << " = " << a << endl;\
 cout << #b << " = " << b << endl;\
 cout << #c << " = " << c << endl;\
 cout << #d << " = " << d << endl;\
 cout << #e << " = " << e << endl
 #define eps 1e-9
 #define PIE acos(-1)
 #define cl(a,b) memset(a,b,sizeof(a))
 #define fastio ios::sync_with_stdio(false);cin.tie(0);
 #define lson l , mid , ls
 #define rson mid + 1 , r , rs
 #define ls (rt<<1)
 #define rs (ls|1)
 #define INF 0x3f3f3f3f
 #define lowbit(x) (x&(-x))
 #define sqr(a) a*a
 #define ll long long
 #define vi vector<int>
 #define pii pair<int, int>
 using namespace std;
 //**********************************
 int a[];
 int n;
 int dp[][];
 //**********************************
 bool match(int x,int y)
 {
     return a[x]==a[y];
 }
 void solve()
 {
     cl(dp,INF);
     FOR(i,,n){
         dp[i][i]=;
         if(a[i]==a[i+])dp[i][i+]=;
     }
     FOR(len,,n){
         FOR(l,,n-len+){
             int r=l+len-;
             if(match(l,r)){
                 if(r==l+)dp[l][r]=;
                 else dp[l][r]=dp[l+][r-];
             }
 //            if(match(l,r))dp[l][r]=min(dp[l][r],dp[l+1][r-1]);
             rep(k,l,r){
                 dp[l][r]=min(dp[l][r],dp[l][k]+dp[k+][r]);
             }
         }
     }
     printf("%d\n",dp[][n]);
 }
 //**********************************
 int main()
 {
     cin>>n;
     FOR(i,,n)cin>>a[i];
     solve();
     return ;
 }