cf1203D1&1203D2 D1. Remove the Substring (easy version)&D2. Remove the Substring (hard version)

dream_it_

于 2019-08-15 11:48:55 发布

阅读量573

点赞数 2

分类专栏： codeforces 文章标签：思维

本文链接：https://blog.youkuaiyun.com/dream_it_/article/details/99626851

版权

给定两个字符串s和t，t是s的子序列。要求删除s中一个最长的连续子串，使得删除后t仍然是s的子序列。输出能删除的最长子串的长度。例如，输入'bbaba'和'bb'，输出3；输入'baaba'和'ab'，输出2。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

D2. Remove the Substring (hard version)
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
The only difference between easy and hard versions is the length of the string.

You are given a string s and a string t, both consisting only of lowercase Latin letters. It is guaranteed that t can be obtained from s by removing some (possibly, zero) number of characters (not necessary contiguous) from s without changing order of remaining characters (in other words, it is guaranteed that t is a subsequence of s).

For example, the strings “test”, “tst”, “tt”, “et” and “” are subsequences of the string “test”. But the strings “tset”, “se”, “contest” are not subsequences of the string “test”.

You want to remove some substring (contiguous subsequence) from s of maximum possible length such that after removing this substring t will remain a subsequence of s.

If you want to remove th