洛谷P2470||bzoj1068 [SCOI2007]压缩

bzoj1068

洛谷P2470

区间dp入门题？只要注意到每个M“管辖”的区间互不相交即可

错误记录：有点小坑，比如aaaacaaaac最优解为aRRcR（意会坑在哪里），踩了一次

 #include<cstdio>
 #include<algorithm>
 #include<cstring>
 #include<vector>
 #include<cassert>
 using namespace std;
 #define fi first
 #define se second
 #define mp make_pair
 #define pb push_back
 typedef long long ll;
 typedef unsigned long long ull;
 typedef pair<int,int> pii;
 int an[][];
 bool v1[][];
 int tmp[];
 char s[];
 int n;
 int solve(int l,int r)
 {
     assert(l<=r);
     if(l==r)    return ;
     if(v1[l][r])    return an[l][r];
     int ans=0x3f3f3f3f;
     for(int i=l;i<r;++i)
         ans=min(ans,solve(l,i)+solve(i+,r));
     tmp[l-]=;
     for(int p=l;p<=r;++p)
     {
         tmp[p]=tmp[p-]+;
         if((p-l+)%==&&!strncmp(s+l,s+l+(p-l+)/,(p-l+)/))
             tmp[p]=min(tmp[p],tmp[l+(p-l+)/-]+);
     }
     ans=min(ans,tmp[r]+(l!=));
     //printf("1t%d %d %d\n",l,r,ans);
     v1[l][r]=;
     return an[l][r]=ans;
 }
 int main()
 {
     scanf("%s",s+);n=strlen(s+);
     printf("%d\n",solve(,n));
     return ;
 }