Codeforces Round #272 (Div. 1)C（字符串DP）

最新推荐文章于 2023-02-04 15:35:33 发布

cq_phqg

最新推荐文章于 2023-02-04 15:35:33 发布

阅读量982

点赞数

分类专栏：区间DP 文章标签： ACM codeforces

本文链接：https://blog.csdn.net/cq_phqg/article/details/40042921

版权

区间DP 专栏收录该内容

9 篇文章 0 订阅

订阅专栏

Dreamoon has a string s and a pattern string p. He first removes exactly x characters from s obtaining string s' as a result. Then he calculates $\text{[math]}$ that is defined as the maximal number of non-overlapping substrings equal to p that can be found in s'. He wants to make this number as big as possible.

More formally, let's define $\text{[math]}$ as maximum value of $\text{[math]}$ over all s' that can be obtained by removing exactly x characters froms. Dreamoon wants to know $\text{[math]}$ for all x from 0 to |s| where |s| denotes the length of string s.

Input

The first line of the input contains the string s (1 ≤ |s| ≤ 2 000).

The second line of the input contains the string p (1 ≤ |p| ≤ 500).

Both strings will only consist of lower case English letters.

Output

Print |s| + 1 space-separated integers in a single line representing the $\text{[math]}$ for all x from 0 to |s|.

    Sample test(s) 
  
      input 
    
aaaaa
aa

      output 
    
2 2 1 1 0 0

      input 
    
axbaxxb
ab

      output 
    
0 1 1 2 1 1 0 0

题意：RT

思路：dp[i][j]表示s的前i个字符一共匹配了j个p串，删掉的最少字符数

先用一个数组en[i]预处理出在s串的每个位置i，直到能最早匹配p串的结束的位置

转移为dp[ en[i+1] ][j+1]= min (dp[ en[i+1] ][j+1] ，dp[ i ][j] + (en[i+1]-i-m) )

#include 
   
   
    
    
#include 
    
    
     
     
#include 
     
     
      
      
#include 
      
      
       
       
#include 
       
       
         using namespace std; const int MAXN = 2010; const int INF = ~0U>>1; char s[MAXN]; char p[510]; int en[MAXN]; int dp[MAXN][MAXN]; int main() { scanf("%s%s",s,p); int n=strlen(s); int m=strlen(p); for(int i=0;i