http://tyvj.cn/p/1102
字符串dp。
感觉C++对字符串处理不是很友好..
做字符串的题目一定要专心!
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxan = 100 + 5;
char a[maxan];
int la;
char s[maxan][maxan];
int l[maxan];
int n;
int f[maxan];
//设f[i]为前i个字母组成最少单词数的值
//初始值f[0] = 1; 其他设为∞
//f[i] = min{f[j]+1|[i..j]组成合法字符串}
bool ise(char *a1, int a2)
{
for (int i=1;i<=l[a2];i++)
if (a1[i]!=s[a2][i-1]) return false;
return true;
}
int main ()
{
scanf("%s", a);
la = strlen(a);
scanf("%d%*c", &n);
for (int i=0;i<n;i++)
{
scanf("%s", s[i]);
l[i] = strlen(s[i]);
}
memset(f, 27, sizeof(f));
f[0] = 1;
for (int i=0;i<la;i++)
{
for (int j=n-1;j>=0;j--)
if (i+1>=l[j])
if (ise(a+i-l[j],j))
{
f[i] = min(f[i], f[i-l[j]]+1);
}
}
printf("%d\n", f[la-1]);
return 0;
}