USACO 2.3.1 Longest Prefix dp

dp[i]=max(dp[i-1],能匹配成的单词的最长长度+i);

View Code

 1 #include <stdio.h>
 2 #include <string.h>
 3 #include <algorithm>
 4 
 5 using namespace std;
 6 
 7 int n,len,ar[205];
 8 char s[205][15],str[200005];
 9 
10 int judge(int i)
11 {
12     int j,k,l,MAX=0;
13     for (j=0;j<n;j++)
14     {
15         for (k=i,l=0;l<ar[j]&&k<=len;k++,l++)
16         {
17             if(s[j][l]!=str[k])break;
18         }
19         if(l==ar[j]&&MAX<l)MAX=l;
20     }
21     return MAX;
22 }
23 
24 int main()
25 {
26     int i=0,j,dp[200005]={0};
27     char ch;
28     while (scanf("%s",s[i])!=EOF)
29     {
30         if(strcmp(s[i],".")==0)break;
31         ar[i++]=strlen(s[i]);
32     }
33     n=i;
34     i=1;
35     getchar();
36     while (scanf("%c",&ch)!= EOF) 
37     {
38         if(ch>='A'&&ch<='Z')
39             str[i++] = ch;
40     }
41     len=i-1;
42     for (i=1;i<=len;i++)
43     {
44         dp[i]=max(dp[i-1],judge(i)+i);
45         if(dp[i]==i)break;
46     }
47     printf("%d\n",i-1);
48     return 0;
49 }

转载于:https://www.cnblogs.com/104-gogo/archive/2011/11/01/2231560.html