ural1238. Folding（记忆化）

1238

这算模拟加记忆化吗 找bug找了2个多小时。。记忆化部分好想 就是字符串处理部分挫了 一个个复制模拟 各种修改查找

 #include <iostream>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #include<stdlib.h>
 #include<vector>
 using namespace std;
 #define INF 0xfffffff
 int dp[][],o[][];
 char s[][][],ss[];
 int len(int x)
 {
     int q=;
     while(x)
     {
         q++;x/=;
     }
     return q;
 }
 int dfs(int x,int y)
 {
     if(dp[x][y]!=INF) return dp[x][y];
     if(x==y)
     {
        s[x][y][] = ss[x];
        s[x][y][] = '\0';
        o[x][y] = ;
        return dp[x][y] = ;
     }
     int i,j,flag,k;
     for(i = x ; i < y ; i++)
     {
         dp[x][i] = dfs(x,i);
         dp[i+][y] = dfs(i+,y);
         flag = ;
         k = INF;
         if(strcmp(s[x][i],s[i+][y])==)
         {
             int t = ;
             if(o[x][i]+o[i+][y]>)
             t+=;
             t+=len(o[x][i]+o[i+][y]);
             k = strlen(s[x][i])+t;flag = ;
         }
         if(dp[x][i]+dp[i+][y]<k)
         {
             k = dp[x][i]+dp[i+][y];//cout<<s[x][i]<<" "<<s[i+1][y]<<" "<<" "<<i+1<<" "<<y<<" "<<dp[x][y]<<endl;
         }
         if(dp[x][y]<=k&&!flag) continue;
         if(dp[x][y]>=k)
         {
             dp[x][y] = k;
             if(!flag)
             {
                 int g = ,q=;
                 int k1 = strlen(s[x][i]);
                 if(o[x][i]<=&&k1==)
                 {
                     for(j = ; j <= o[x][i]; j++)
                     s[x][y][g++] = s[x][i][];
                 }
                 else if(o[x][i]<=&&k1==)
                 {
                     for(j = ; j <= o[x][i] ; j++)
                     {
                         s[x][y][g++] = s[x][i][];
                         s[x][y][g++] = s[x][i][];
                     }
                 }
                 else
                 {
                     if(o[x][i]>)
                     {
                         int qq = o[x][i],a[],t=;
                         while(qq)
                         {
                             a[t++] = qq%;
                             qq/=;
                         }
                         for(j = t- ; j >=  ; j--)
                         s[x][y][g++] = a[j]+'';
                         s[x][y][g++] = '(';
                         q = ;
                     }
                     for(j =  ; j < k1;j++)
                     s[x][y][g++] = s[x][i][j];
                     if(q)
                     s[x][y][g++] = ')';
                 }
                 k1 = strlen(s[i+][y]);q=;
                 if(o[i+][y]<=&&k1==)
                 {
                     for(j = ; j <= o[i+][y]; j++)
                     s[x][y][g++] = s[i+][y][];
                 }
                 else if(o[i+][y]<=&&k1==)
                 {
                     for(j = ; j <= o[i+][y] ; j++)
                     {
                         s[x][y][g++] = s[i+][y][];
                         s[x][y][g++] = s[i+][y][];
                     }
                 }
                 else
                 {
                     if(o[i+][y]>)
                     {
                         int qq = o[i+][y],a[],t=;
                         while(qq)
                         {
                             a[t++] = qq%;
                             qq/=;
                         }
                         for(j = t- ; j >=  ; j--)
                         s[x][y][g++] = a[j]+'';
                         s[x][y][g++] = '(';
                         q = ;
                     }
                     for(j =  ; j < k1;j++)
                     s[x][y][g++] = s[i+][y][j];
                     if(q)
                     s[x][y][g++] = ')';
                 }
                 o[x][y] = ;
                 s[x][y][g] = '\0';
             }
             else
             {
                 strcpy(s[x][y],s[x][i]);
                 //cout<<s[x][y]<<" "<<x<<" "<<y<<endl;
                 o[x][y] = o[x][i]+o[i+][y];
             }
         }
     }
     return dp[x][y];
 }
 int main()
 {
     int i,j,k;
     for(i =  ;i <=  ; i++)
     for(j =  ;j <=  ; j++)
     dp[i][j] = INF;
     cin>>ss;
     k = strlen(ss);
     int minz = dfs(,k-),q=strlen(s[][k-]);
     //cout<<q<<endl;
     if(o[][k-]<=&&q==)
     for(i = ; i <= o[][k-] ; i++)
     cout<<s[][k-][];
     else if(o[][k-]<=&&q==)
     for(i =  ; i <= o[][k-] ; i++)
     {
         cout<<s[][k-][]<<s[][k-][];
     }
     else
     {
         if(o[][k-]>)
         cout<<o[][k-]<<'(';
         for(i =  ; i < q ; i++)
         cout<<s[][k-][i];
         if(o[][k-]>)
         cout<<')';
     }
     puts("");
     return ;
 }