cf1203(div3)D1D2

这个水题挺好

- 给定两个串s, t

- 保证t是s的子串(子序列)

- 现想在s串上切片, 且保证切片后,t还是s的子序列, 现在询问切片的最大长度;

>> face <<

easy-version: s, t的串长最多不超过200

easy-version-tutorial:看到看到数据想到暴力, 把所有的区间都删一遍, 判断删掉区间后是否还含有子序列t, 比较欣赏题解的solution, 自己写的太复杂了

#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std;
#define _rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define _rev(i, a, b) for (int i = (a); i >= (b); --i)
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
#define _rof(i, a, b) for (int i = (a); i > (b); --i)
#define oo 0x3f3f3f3f
#define ll long long
#define db double
#define eps 1e-8
#define bin(x) cout << bitset<10>(x) << endl;
#define what_is(x) cerr << #x << " is " << x << "s" << endl;
#define met(a, b) memset(a, b, sizeof(a))
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
ll nxt()
{
	ll ret;
	scanf("%lld", &ret);
	return ret;
}
const int maxn = 210;
string s, t;

signed main(){
	cin >> s >> t;
	int ans = 0;
	_for(i, 0, s.size()){
		_for(j, i, s.size()){
			int id_t = 0;
			_for(k, 0, s.size()){
				if(k >= i && k <= j)continue;
				if(id_t < t.size() && t[id_t] == s[k])id_t++;
			}
			if(id_t == t.size())ans = max(ans, j - i + 1);
		}
	}
	cout << ans << endl;
}

hard-version: s, t的串长最多不超过2e5

hard-version-tutorial:维护两个数组lm,rm分别表示t的左半串/右半串在s中对应的leftmost/rightmost下标, 答案即为max(r[i] - l[i-1]), 答案可以初始化成两头剪的情况

#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std;
#define _rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define _rev(i, a, b) for (int i = (a); i >= (b); --i)
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
#define _rof(i, a, b) for (int i = (a); i > (b); --i)
#define oo 0x3f3f3f3f
#define ll long long
#define db double
#define eps 1e-8
#define bin(x) cout << bitset<10>(x) << endl;
#define what_is(x) cerr << #x << " is " << x << "s" << endl;
#define met(a, b) memset(a, b, sizeof(a))
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
ll nxt()
{
	ll ret;
	scanf("%lld", &ret);
	return ret;
}
const int maxn = 2e5 + 10;
string s, t;
int rm[maxn], lm[maxn];
signed main()
{
	cin >> s >> t;
	int id_t = 0;
	_for(i, 0, s.size())
	{
		if (s[i] == t[id_t] && id_t < t.size())
		{
			lm[id_t++] = i;
		}
	}
	assert(id_t-- == t.size());

	for (int i = s.size() - 1; i >= 0; i--)
	{
		if (id_t >= 0 && s[i] == t[id_t])
		{
			rm[id_t--] = i;
		}
	}
	assert(id_t == -1);

	int ans = max((signed)(s.size() - 1 - lm[t.size() - 1]), rm[0]);
	_for(i, 1, t.size())
	{
		ans = max(ans, rm[i] - lm[i - 1] - 1);
	}

	cout << ans << endl;
}