区间DP（入门）括号匹配

https://www.nitacm.com/problem_show.php?pid=8314

思路：类似于https://blog.youkuaiyun.com/MIKASA3/article/details/51523563

  1 #define IOS ios_base::sync_with_stdio(0); cin.tie(0);
  2 #include <cstdio>//sprintf islower isupper
  3 #include <cstdlib>//malloc  exit strcat itoa system("cls")
  4 #include <iostream>//pair
  5 #include <fstream>//freopen("C:\\Users\\13606\\Desktop\\草稿.txt","r",stdin);
  6 #include <bitset>
  7 //#include <map>
  8 //#include<unordered_map>
  9 #include <vector>
 10 #include <stack>
 11 #include <set>
 12 #include <string.h>//strstr substr
 13 #include <string>
 14 #include <time.h>//srand(((unsigned)time(NULL))); Seed n=rand()%10 - 0~9;
 15 #include <cmath>
 16 #include <deque>
 17 #include <queue>//priority_queue<int, vector<int>, greater<int> > q;//less
 18 #include <vector>//emplace_back
 19 //#include <math.h>
 20 //#include <windows.h>//reverse(a,a+len);// ~ ! ~ ! floor
 21 #include <algorithm>//sort + unique : sz=unique(b+1,b+n+1)-(b+1);+nth_element(first, nth, last, compare)
 22 using namespace std;//next_permutation(a+1,a+1+n);//prev_permutation
 23 //******************
 24 int abss(int a);
 25 int lowbit(int n);
 26 int Del_bit_1(int n);
 27 int maxx(int a,int b);
 28 int minn(int a,int b);
 29 double fabss(double a);
 30 void swapp(int &a,int &b);
 31 clock_t __STRAT,__END;
 32 double __TOTALTIME;
 33 void _MS(){__STRAT=clock();}
 34 void _ME(){__END=clock();__TOTALTIME=(double)(__END-__STRAT)/CLOCKS_PER_SEC;cout<<"Time: "<<__TOTALTIME<<" s"<<endl;}
 35 //***********************
 36 #define rint register int
 37 #define fo(a,b,c) for(rint a=b;a<=c;++a)
 38 #define fr(a,b,c) for(rint a=b;a>=c;--a)
 39 #define mem(a,b) memset(a,b,sizeof(a))
 40 #define pr printf
 41 #define sc scanf
 42 #define ls rt<<1
 43 #define rs rt<<1|1
 44 typedef long long ll;
 45 const double E=2.718281828;
 46 const double PI=acos(-1.0);
 47 //const ll INF=(1LL<<60);
 48 const int inf=(1<<30);
 49 const double ESP=1e-9;
 50 const int mod=(int)1e9+7;
 51 const int N=(int)1e2+10;
 52 
 53 int dp[N][N];
 54 char s[N];
 55 
 56 int main()
 57 {
 58     while(sc("%s",s+1)&&s[1]!='e')
 59     {
 60         int l=strlen(s+1);
 61         mem(dp,0);
 62         for(int len=2;len<=l;++len)
 63         {
 64             for(int i=1;i<=l-len+1;++i)
 65             {
 66                 if(s[i]=='('&&s[i+len-1]==')'||s[i]=='['&&s[i+len-1]==']')
 67                     dp[i][i+len-1]=dp[i+1][i+len-2]+2;
 68                 for(int j=i;j<=i+len-1;++j)
 69                     dp[i][i+len-1]=max(dp[i][i+len-1],dp[i][j]+dp[j+1][i+len-1]);
 70             }
 71         }
 72         pr("%d\n",dp[1][l]);
 73     }
 74     return 0;
 75 }
 76 
 77 /**************************************************************************************/
 78 
 79 int maxx(int a,int b)
 80 {
 81     return a>b?a:b;
 82 }
 83 
 84 void swapp(int &a,int &b)
 85 {
 86     a^=b^=a^=b;
 87 }
 88 
 89 int lowbit(int n)
 90 {
 91     return n&(-n);
 92 }
 93 
 94 int Del_bit_1(int n)
 95 {
 96     return n&(n-1);
 97 }
 98 
 99 int abss(int a)
100 {
101     return a>0?a:-a;
102 }
103 
104 double fabss(double a)
105 {
106     return a>0?a:-a;
107 }
108 
109 int minn(int a,int b)
110 {
111     return a<b?a:b;
112 }

 

转载于:https://www.cnblogs.com/--HPY-7m/p/11587208.html