Invoker(小DP）

题意：http://acm.hdu.edu.cn/showproblem.php?pid=6739

尽量让他们连起来。

思路：

直接dp，其中一个状态是以什么结尾。

 #define IOS ios_base::sync_with_stdio(0); cin.tie(0);
 #include <cstdio>//sprintf islower isupper
 #include <cstdlib>//malloc  exit strcat itoa system("cls")
 #include <iostream>//pair
 #include <fstream>//freopen("C:\\Users\\13606\\Desktop\\草稿.txt","r",stdin);
 #include <bitset>
 //#include <map>
 //#include<unordered_map>
 #include <vector>
 #include <stack>
 #include <set>
 #include <string.h>//strstr substr
 #include <string>
 #include <time.h>//srand(((unsigned)time(NULL))); Seed n=rand()%10 - 0~9;
 #include <cmath>
 #include <deque>
 #include <queue>//priority_queue<int, vector<int>, greater<int> > q;//less
 #include <vector>//emplace_back
 //#include <math.h>
 //#include <windows.h>//reverse(a,a+len);// ~ ! ~ ! floor
 #include <algorithm>//sort + unique : sz=unique(b+1,b+n+1)-(b+1);+nth_element(first, nth, last, compare)
 using namespace std;//next_permutation(a+1,a+1+n);//prev_permutation
 //******************
 int abss(int a);
 int lowbit(int n);
 int Del_bit_1(int n);
 int maxx(int a,int b);
 int minn(int a,int b);
 double fabss(double a);
 void swapp(int &a,int &b);
 clock_t __STRAT,__END;
 double __TOTALTIME;
 void _MS(){__STRAT=clock();}
 void _ME(){__END=clock();__TOTALTIME=(double)(__END-__STRAT)/CLOCKS_PER_SEC;cout<<"Time: "<<__TOTALTIME<<" s"<<endl;}
 //***********************
 #define rint register int
 #define fo(a,b,c) for(rint a=b;a<=c;++a)
 #define fr(a,b,c) for(rint a=b;a>=c;--a)
 #define mem(a,b) memset(a,b,sizeof(a))
 #define pr printf
 #define sc scanf
 #define ls rt<<1
 #define rs rt<<1|1
 typedef long long ll;
 const double E=2.718281828;
 const double PI=acos(-1.0);
 //const ll INF=(1LL<<60);
 const int inf=(<<);
 const double ESP=1e-;
 const int mod=(int)1e9+;
 const int N=(int)1e5+;

 int dp[N][];
 char s[N];
 int tot;
 int ID[];
 int map[];
 int id(int x)
 {
     return ID[x];
 }
 struct node
 {
     int a,b,c;
 }p[];
 void PR(int _[],int n)
 {
     for(int i=;i<=n;++i)
         pr("%d ",_[i]);
     pr("\n");
 }
 int main()
 {
     tot=;
     for(int i=;i<=;++i)
     {
         int temp=i;
         bool f=;
         while(temp>)
         {
             if(temp%!=&&temp%!=&&temp%!=)
                 f=;
             temp/=;
         }
         if(f)map[++tot]=i;
     }
     for(int i=;i<=;++i)
         ID[map[i]]=i;
     p[]={,,};
     p[]={,,};
     p[]={,,};
     p[]={,,};
     p[]={,,};
     p[]={,,};
     int v[];
     v['Y']=;
     v['V']=;
     v['G']=;
     v['C']=;
     v['X']=;
     v['Z']=;
     v['T']=;
     v['F']=;
     v['D']=;
     v['B']=;
     while(~sc("%s",s+))
     {
         int l=strlen(s+);
         for(int i=;i<=l;++i)
             for(int j=;j<=;++j)
                 dp[i][j]=inf;
         for(int i=;i<=;++i)
         {
             int temp=v[s[]];
             int cnt=;
             int mp[];
             while(temp>)
             {
                 mp[cnt]=temp%;
                 temp/=;
                 cnt--;
             }
             int x=mp[p[i].b]*+mp[p[i].c];
             dp[][id(mp[p[i].a]*+mp[p[i].b]*+mp[p[i].c])]=min(,dp[][id(mp[p[i].a]*+mp[p[i].b]*+mp[p[i].c])]);
             dp[][id(x)]=min(dp[][id(x)],);
             x=mp[p[i].c];
             dp[][id(x)]=min(dp[][id(x)],);
         }
         //PR(dp[1],37);
         int ans=;
         for(int i=;i<=l+;++i)
         {
             int min_=inf;
             for(int j=;j<=;++j)
                 min_=min(min_,dp[i-][j]);
             ans=min_;
             if(i==l+)break;

             int temp=v[s[i]];
             int cnt=;
             int mp[];
             while(temp>)
             {
                 mp[cnt]=temp%;
                 temp/=;
                 cnt--;
             }
             for(int j=;j<=;++j)
             {
                 int x=mp[p[j].a],y=mp[p[j].b],z=mp[p[j].c];
             //    cout<<x<<' '<<y<<' '<<z<<endl;
                 dp[i][id(x*+y*+z)]=min(dp[i][id(x*+y*+z)],min(min(dp[i-][id(x)]+,min(min_+,dp[i-][id(x*+y)]+)),dp[i-][id(x*+y*+z)]));
                 dp[i][id(y*+z)]=min(dp[i][id(y*+z)],min(min(dp[i-][id(x)]+,min(min_+,dp[i-][id(x*+y)]+)),dp[i-][id(x*+y*+z)]));
                 dp[i][id(z)]=min(dp[i][id(z)],min(min(dp[i-][id(x)]+,min(min_+,dp[i-][id(x*+y)]+)),dp[i-][id(x*+y*+z)]));
             }
         //    PR(dp[i],37);
         }
         pr("%d\n",ans+l);
     }
     return ;
 }

 /**************************************************************************************/

 int maxx(int a,int b)
 {
     return a>b?a:b;
 }

 void swapp(int &a,int &b)
 {
     a^=b^=a^=b;
 }

 int lowbit(int n)
 {
     return n&(-n);
 }

 int Del_bit_1(int n)
 {
     return n&(n-);
 }

 int abss(int a)
 {
     return a>?a:-a;
 }

 double fabss(double a)
 {
     return a>?a:-a;
 }

 int minn(int a,int b)
 {
     return a<b?a:b;
 }