摘要:
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<a 阅读全文