Codeforces Round #704 (Div. 2)-C. Maximum width

传送门
Time Limit: 2 seconds
Memory Limit: 512 megabytes

Problem Description

Your classmate, whom you do not like because he is boring, but whom you respect for his intellect, has two strings: s s s of length n n n and t t t of length m m m.

A sequence p 1 , p 2 , … , p m p_1, p_2, \ldots, p_m p1,p2,…,pm, where 1 ≤ p 1 < p 2 < … < p m ≤ n 1 \leq p_1 < p_2 < \ldots < p_m \leq n 1≤p1<p2<…<pm≤n, is called beautiful, if s p i = t i s_{p_i} = t_i spi=ti for all i i i from 1 1 1 to m m m. The width of a sequence is defined as max ⁡ 1 ≤ i < m ( p i + 1 − p i ) \max\limits_{1 \le i < m} \left(p_{i + 1} - p_i\right) 1≤i<mmax(pi+1−pi).

Please help your classmate to identify the beautiful sequence with the maximum width. Your classmate promised you that for the given strings s s s and t t t there is at least one beautiful sequence.

Input

The first input line contains two integers n n n and m m m ( 2 ≤ m ≤ n ≤ 2 ⋅ 1 0 5 2 \leq m \leq n \leq 2 \cdot 10^5 2≤m≤n≤2⋅105) — the lengths of the strings s s s and t t t.

The following line contains a single string s s s of length n n n, consisting of lowercase letters of the Latin alphabet.

The last line contains a single string t t t of length m m m, consisting of lowercase letters of the Latin alphabet.

It is guaranteed that there is at least one beautiful sequence for the given strings.

Output

Output one integer — the maximum width of a beautiful sequence.

Sample Input

5 3
abbbc
abc

Sample Onput

Note

In the first example there are two beautiful sequences of width 3 3 3: they are { 1 , 2 , 5 } \{1, 2, 5\} {1,2,5} and { 1 , 4 , 5 } \{1, 4, 5\} {1,4,5}.

In the second example the beautiful sequence with the maximum width is { 1 , 5 } \{1, 5\} {1,5}.

In the third example there is exactly one beautiful sequence — it is { 1 , 2 , 3 , 4 , 5 } \{1, 2, 3, 4, 5\} {1,2,3,4,5}.

In the fourth example there is exactly one beautiful sequence — it is { 1 , 2 } \{1, 2\} {1,2}.

题目大意

两个字符串s和t长度分别是n和m。
在s从左到右选一些字母组成t。
问s中所有选中的字符中，最大间距是多少。

题目保证能从s中选出t。

题目分析

要使间距最大，就要t中的某两个相邻的字母在s中选择时，第一个字母尽可能往前，第二个字母尽可能往后，这样才能使间距最大。

如s(abbbc)中选择t(abc)，看t中相邻两个字母，先看a和b，a要选的尽可能靠前（其实就一种选择），所以选第1个。b要选的尽可能靠后（可以选第2~4个），所以选第4个。这样的话它的最大间距就是4-3=3。同理看b和c时，应分别选择第2个和第5个，间距同样是5-2=3。所以最大间距是3。

解题思路

先从前往后遍历一遍，得到t中每个字母最靠前能选到s的第几个；
再从后往前遍历一遍，得到t中每个字母最靠后能选到s的第几个。
考虑所有t中相邻的两个字母，看看第一个字母最靠前，第二个字母最靠后，间距是多少。
更新最大间距，直到遍历完t。

AC代码

#include <bits/stdc++.h>
using namespace std;
#define mem(a) memset(a, 0, sizeof(a))
#define dbg(x) cout << #x << " = " << x << endl
#define fi(i, l, r) for (int i = l; i < r; i++)
#define cd(a) scanf("%d", &a)
typedef long long ll;
char s[200010];
char t[200010];
int zuiQian[200010]; //最靠前能选到s中的第几个
int zuiHou[200010]; //最靠后能选到s中的第几个
int main()
{int n, m, M = 1;scanf("%d%d", &n, &m);scanf("%s", s);scanf("%s", t);int lastT = -1;for (int i = 0; i < m; i++){while (s[++lastT] != t[i]) //找到s中第一个没有选过的并且与t的下一个相同的字母。;zuiQian[i] = lastT;}lastT = n;for (int i = m - 1; i >= 0; i--){while (s[--lastT] != t[i]);zuiHou[i] = lastT;}for (int i = 1; i < m; i++){M = max(M, zuiHou[i] - zuiQian[i - 1]); //更新最大值}printf("%d\n", M);return 0;
}

注意事项

while (s[++lastT] != t[i]);是打比赛时确定s中下一个位置的简便写法。

学会的话打比赛会快亿点点，但是小心不要用错了哦。

Codeforces Round #704 (Div. 2)-C. Maximum width-题解相关推荐

Codeforces Round #704 (Div. 2)-B. Card Deck-题解
目录 Codeforces Round #704 (Div. 2)-B. Card Deck Problem Description Input Output Sample Input Sample ...
Codeforces Round #704 (Div. 2)-A. Three swimmers-题解
目录 Codeforces Round #704 (Div. 2)-A. Three swimmers Problem Description Input Output Sample Input Sa ...
Codeforces Round #595 (Div. 3) F. Maximum Weight Subset 树形dp
传送门文章目录题意: 思路: 题意: n≤200n\le200n≤200 思路: 明显的树形dpdpdp,所以考虑一下dpdpdp状态. 这个题状态挺神的..可能是因为我太菜了,看了半天才看懂. ...
Codeforces Round #807 (Div. 2)A~E个人题解
Dashboard - Codeforces Round #807 (Div. 2) - Codeforces A. Mark the Photographer 题意: 有个人,每个人的身高设为,现在 ...
Codeforces Round #706 (Div. 2)-A. Split it!-题解
目录 Codeforces Round #706 (Div. 2)-A. Split it! Problem Description Input Output Sample Input Sample ...
Codeforces Round #704 (Div. 2)（A ~ E）5题全超高质量题解【每日亿题2 / 23】
整理的算法模板合集: ACM模板点我看算法全家桶系列!!! 实际上是一个全新的精炼模板整合计划目录 A.Three swimmers B.Card Deck C.Maximum width D.G ...
Codeforces Round #704 (Div. 2) A-E题解
A Three swimmers 题意三个人每人游一个来回时间分别是a.b.c,那么在 a.b.c的倍数时间点上三个人均会在左边的点,题目问你p时刻来还要等多久最快遇到三个人 1e18 除法判断 ...
Codeforces Round #742 (Div. 2) B、C 题解
Codeforces Round 742 B. MEXor Mixup 题意有一个数组,输入两个数a,b,a代表这个数组之外的最小非负整数,b代表这个数组的异或值,问你该数组的最小长度. 思路首先 ...
Codeforces Round #704 (Div. 2) E. Almost Fault-Tolerant Database 思维
传送门题意: 给nnn个长度为mmm的数组,要求构造一个长度为mmm的数组,使得这个数组与前面nnn个数组同一位置最多两个元素不同. 思路: 我们为了方便构造,可以先把要构造的数组看成nnn个数组的 ...

Codeforces Round #704 (Div. 2)-C. Maximum width-题解

目录