电子商务网站建设的具体内容/厦门搜索引擎优化

Catching Cheaters

传送门

题面翻译

给我们两个字符串，让我们从中选出两个字串，算出它们的最大公共子序列长度。然后将它乘$4$在减去两个字串的长度。问你这个数最大是多少。

题目描述

You are given two strings $A$ and $B$ representing essays of two students who are suspected cheaters. For any two strings $C$ , $D$ we define their similarity score $S(C,D)$ as $4\cdot LCS(C,D)-|C|-|D|$ , where $LCS(C,D)$ denotes the length of the Longest Common Subsequence of strings $C$ and $D$ .

You believe that only some part of the essays could have been copied, therefore you’re interested in their substrings.

Calculate the maximal similarity score over all pairs of substrings. More formally, output maximal $S(C,D)$ over all pairs $(C,D)$ , where $C$ is some substring of $A$ , and $ D $ is some substring of $B$ .

If $X$ is a string, $|X|$ denotes its length.

A string $a$ is a substring of a string $b$ if $a$ can be obtained from $b$ by deletion of several (possibly, zero or all) characters from the beginning and several (possibly, zero or all) characters from the end.

A string $a$ is a subsequence of a string $b$ if $a$ can be obtained from $b$ by deletion of several (possibly, zero or all) characters.

Pay attention to the difference between the substring and subsequence, as they both appear in the problem statement.

You may wish to read the Wikipedia page about the Longest Common Subsequence problem.

输入格式

The first line contains two positive integers $n$ and $m$ ( $1\le n,m\le 5000$ ) — lengths of the two strings $A$ and $B$ .

The second line contains a string consisting of $n$ lowercase Latin letters — string $A$ .

The third line contains a string consisting of $m$ lowercase Latin letters — string $B$ .

输出格式

Output maximal $S(C,D)$ over all pairs $(C,D)$ , where $C$ is some substring of $A$ , and $D$ is some substring of $B$ .

样例 #1

样例输入 #1

4 5
abba
babab

样例输出 #1

5

样例 #2

样例输入 #2

8 10
bbbbabab
bbbabaaaaa

样例输出 #2

12

样例 #3

样例输入 #3

7 7
uiibwws
qhtkxcn

样例输出 #3

0

提示

For the first case:

abb from the first string and abab from the second string have LCS equal to abb.

The result is $S(abb,abab)=(4\cdot |abb|)-|abb|-|abab|=4\cdot 3-3-4=5$ .

$以上来自洛谷$

解题思路

首先，暴力肯定过不了。

考虑DP。设 $f_{i,j}$ 表示以 $a_i,b_i$ 为两字串的末位的相似值（相似值计算： $4\times LCS(A,B)-|A|-|B|$）。当 $i+1$ 或 $j+1$ 时，对 $LCS(A,B)$ 无贡献，而对 $|A|$ 或 $|B|$ 贡献为 $1$，所以对相似值贡献为 $(4\times LCS(A^{\prime },B)-|A^{\prime }|-|B|)-(4\times LCS(|A|,|B|)-|A|-|B|)=(4\times LCS(A,B)-(|A|+1)-|B|)-(4\times LCS(A,B)-|A|-||B)=4\ast LCS(A,B)-|A|-1-|B|-4\times LCS(A,B)+|A|+|B|=-1$，则有 $f_{i,j}=\max (f_{i,j},\max (f_{i-1,j},f_{i,j-1}))$。当 $i+1$ 且 $j+1$ 的同时满足 $a_{i+1}=b_{j+1}$，则对 $LCS(A,B)$ 的贡献为 $4$，对 $|A|+|B|$ 的贡献为 $2$，所以对相似值的贡献为 $(4\times LCS(A^{\prime },B^{\prime })-|A^{\prime }|-|B^{\prime }|)-(4\times LCS(A,B)-|A|-|B|)=(4\times (LCS(A,B)+1)-(|A|+1)-(|B|+1))-(4\times LCS(A,B)-|A|-|B|)=(4\times LCS(A,B)+4-|A|-1-|B|-1)-(4\times LCS(A,B)-|A|-|B|)=4\times LCS(A,B)+4-|A|-1-|B|-1-4\times LCS(A,B)+|A|+|B|=2$，由此可得此时 $f_{i,j}=f_{i-1,j-1}+2$。

AC Code

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int Maxn = 5000 + 5;
int n, m;
char s1[Maxn], s2[Maxn];
int f[Maxn][Maxn];
int ans;
inline void work() {cin >> n >> m >> s1 + 1 >> s2 + 1;for (int i = 1; i <= n; i++) {for (int j = 1; j <= m; j++) {f[i][j] = max(f[i][j], max(f[i][j - 1], f[i - 1][j]) - 1);if (s1[i] == s2[j]) {f[i][j] = f[i - 1][j - 1] + 2;}ans = max(ans, f[i][j]);}}cout << ans << endl;
}
signed main() {ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);work();return 0;
}

还不会？看这里。