HZAUoj 1015: LCS

题目链接：HZAUoj 1015: LCS 

#include <cstdio>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <iostream>
#include <algorithm>
#include <queue>
#include <string>
#include <stack>
#define CLR(a, b) memset(a, b, sizeof(a))
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int MAXN = 3 * 1e6 + 10;
const int MOD = 9973;
const int INF = 0x3f3f3f3f;
int End[2200][2200], start[2200][2200];
int dp[2200][2200];
char a[2200], b[2200];
int main()
{
    int k;
    while(scanf("%s%s", a+1, b+1) != EOF) {
        scanf("%d", &k);
        int la = strlen(a+1), lb = strlen(b+1);
        End[0][0] = 0;
        for(int i = 1; i <= la; i++) {
            for(int j = 1; j <= lb; j++) {
                if(a[i] == b[j]) {
                    End[i][j] = End[i-1][j-1] + 1;
                }
                else {
                    End[i][j] = 0;
                }
                dp[i][j] = 0;
            }
        }
        for(int i = 1; i <= la; i++) {
            for(int j = 1; j <= lb; j++) {
                if(End[i][j] >= k) {
                    dp[i][j] = max(dp[i - k][j - k] + k, dp[i - End[i][j]][j - End[i][j]] + End[i][j]);
                }
                else {
                    dp[i][j] = max(dp[i-1][j], dp[i][j-1]);
                }
            }
        }
        printf("%d\n", dp[la][lb]);
    }
    return 0;
}