Codeforces Round #358 (Div. 2) D

25 篇文章 0 订阅
D. Alyona and Strings
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

After returned from forest, Alyona started reading a book. She noticed strings s and t, lengths of which are n and m respectively. As usual, reading bored Alyona and she decided to pay her attention to strings s and t, which she considered very similar.

Alyona has her favourite positive integer k and because she is too small, k does not exceed 10. The girl wants now to choose k disjoint non-empty substrings of string s such that these strings appear as disjoint substrings of string t and in the same order as they do in string s. She is also interested in that their length is maximum possible among all variants.

Formally, Alyona wants to find a sequence of k non-empty strings p1, p2, p3, ..., pk satisfying following conditions:

  • s can be represented as concatenation a1p1a2p2... akpkak + 1, where a1, a2, ..., ak + 1 is a sequence of arbitrary strings (some of them may be possibly empty);
  • t can be represented as concatenation b1p1b2p2... bkpkbk + 1, where b1, b2, ..., bk + 1 is a sequence of arbitrary strings (some of them may be possibly empty);
  • sum of the lengths of strings in sequence is maximum possible.

Please help Alyona solve this complicated problem and find at least the sum of the lengths of the strings in a desired sequence.

substring of a string is a subsequence of consecutive characters of the string.

Input

In the first line of the input three integers nmk (1 ≤ n, m ≤ 10001 ≤ k ≤ 10) are given — the length of the string s, the length of the string t and Alyona's favourite number respectively.

The second line of the input contains string s, consisting of lowercase English letters.

The third line of the input contains string t, consisting of lowercase English letters.

Output

In the only line print the only non-negative integer — the sum of the lengths of the strings in a desired sequence.

It is guaranteed, that at least one desired sequence exists.

Examples
input
3 2 2
abc
ab
output
2
input
9 12 4
bbaaababb
abbbabbaaaba
output
7
Note

The following image describes the answer for the second sample case:


注意到k很小,我们可以把每个string分割成2*k+1段
f[i][j][k] = if( k&1) f[x][y][k-1]
else if (s[i] == t[j]) 1+max(f[i-1][j-1][k],f[i][j][k-1])
第二个方程为什么是这样?
要么是本段接着前面,要么另取一段
而第一个方程的优化很简单

 
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<queue>
using namespace std;

const int maxn = 1010;

int n,m,k,c[maxn],f[maxn][maxn][25];
char s[maxn],t[maxn];

int main()
{
	#ifdef YZY
		   freopen("yzy.txt","r",stdin);
	#endif
	
	cin >> n >> m >> k;
	scanf("%s",1+s);
	scanf("%s",1+t);
	int l,i,j;
	for (l = 2; l <= 2*k+1; l++) {
		if (l&1) {
			memset(c,0,sizeof(c));
			for (i = l/2; i <= n; i++)
				for (j = l/2; j <= m; j++) {
					c[j] = max(c[j],max(c[j-1],f[i][j][l-1]));
					f[i][j][l] = c[j];
				}
		}
		else {
			for (i = l/2; i <= n; i++)
				for (j = l/2; j <= m; j++)
					if (s[i] == t[j])
						f[i][j][l] = 1 + max(f[i-1][j-1][l],f[i-1][j-1][l-1]);
		}
	}
	cout << f[n][m][2*k+1];
	return 0;
}


  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值