Codeforces 682D Alyona and Strings【dp】

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 p₁, p₂, p₃, ..., p_k satisfying following conditions:

• s can be represented as concatenation a₁p₁a₂p₂... a_kp_ka_k + 1, where a₁, a₂, ..., a_k + 1 is a sequence of arbitrary strings (some of them may be possibly empty);
• t can be represented as concatenation b₁p₁b₂p₂... b_kp_kb_k + 1, where b₁, b₂, ..., b_k + 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.

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

Input

In the first line of the input three integers n, m, k (1 ≤ n, m ≤ 1000, 1 ≤ 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:

题目大意：

给你一个长度为n和一个长度为m的字符串，让你将第一个字符串分成k段，使其按照相对位子和第二个字符串匹配的长度最大。

问这个最大长度。

思路：

考虑dp，设定dp【i】【j】【k】【2】：

dp【i】【j】【k】【0】表示第一个字符串位子到i，第二个字符串位子到j.已经分配完了k段，并且当前最后一个字符不希望延展的最大长度。

dp【i】【j】【k】【1】表示第一个字符串位子到i，第二个字符串位子到j.已经分配完了k段，并且当前最后一个字符希望延展的最大长度。

那么有：

if（a【i】==b【j】）

dp【i】【j】【k】【1】=max（dp【i-1】【j-1】【k-1】【0】+1，dp【i-1】【j-1】【k-1】【1】）；从不希望延展的结尾处从新开辟一段子序列。

dp【i】【j】【k】【1】=max（dp【i-1】【j-1】【k】【1】+1，dp【i-1】【j-1】【k-1】【1】）；从希望延展的结尾处继续延展。

无论a【i】是否和b【j】相等都有：

dp【i】【j】【k】【0】=max（dp【i-1】【j-1】【k】【0】，dp【i】【j】【k】【0】）；

dp【i】【j】【k】【0】=max（dp【i-1】【j】【k】【0】，dp【i】【j】【k】【0】）；

dp【i】【j】【k】【0】=max（dp【i】【j-1】【k】【0】，dp【i】【j】【k】【0】）；

dp【i】【j】【k】【0】=max（dp【i】【j】【k】【1】，dp【i】【j】【k】【0】）；

Ac代码：

#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
char a[1500];
char b[1500];
int dp[1005][1005][12][2];
int main()
{
    int n,m,kk;
    while(~scanf("%d%d%d",&n,&m,&kk))
    {
        memset(dp,0,sizeof(dp));
        scanf("%s",a+1);
        scanf("%s",b+1);
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                for(int k=1;k<=kk;k++)
                {
                    if(a[i]==b[j])
                    {
                        dp[i][j][k][1]=max(dp[i-1][j-1][k-1][0]+1,dp[i][j][k][1]);
                        dp[i][j][k][1]=max(dp[i-1][j-1][k][1]+1,dp[i][j][k][1]);
                    }
                    dp[i][j][k][0]=max(dp[i][j][k][1],dp[i][j][k][0]);
                    dp[i][j][k][0]=max(dp[i][j-1][k][0],dp[i][j][k][0]);
                    dp[i][j][k][0]=max(dp[i-1][j-1][k][0],dp[i][j][k][0]);
                    dp[i][j][k][0]=max(dp[i-1][j][k][0],dp[i][j][k][0]);
                }
            }
        }
        printf("%d\n",max(dp[n][m][kk][0],dp[n][m][kk][1]));
    }
}