bzoj1090：[SCOI2003]字符串折叠

 1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstring>
 4 #include<algorithm>
 5 #include<cmath>
 6 using namespace std;
 7  
 8 char s[105];
 9 int f[105][105];
10  
11 bool check(int l,int r,int len){
12     for (int i=l;;i+=len){
13         if (i+len>r) break;
14         for (int j=i;j<=i+len-1;j++)
15             if (s[j]!=s[j+len] && j+len<=r) return 0;
16     }
17     return 1;
18 }
19  
20 int calc(int n,int len){
21     int ans=0;n/=len;while (n) n/=10,ans++;return ans; 
22 }
23  
24 int dp(int l,int r){
25     if (l==r) return f[l][r]=1;
26     if (f[l][r]) return f[l][r];
27     int len=r-l+1;f[l][r]=r-l+1;
28     for (int mid=l;mid<r;mid++) f[l][r]=min(f[l][r],dp(l,mid)+dp(mid+1,r));
29     for (int L=1;L<len;L++) if (len%L==0 && check(l,r,L)) f[l][r]=min(f[l][r],dp(l,l+L-1)+2+calc(len,L));
30     return f[l][r];
31 }
32  
33 int main(){
34     scanf("%s",s+1);
35     printf("%d",dp(1,strlen(s+1)));
36     return 0;
37 }