2021牛客暑期多校训练营4:C-LCS

题目链接

题意:三个长为n的字符串$s1,s2,s3$,已知$LCS(s1,s2)=a,LCS(s2,s3)=b,LCS(s1,s3)=c$,请你构造出符合条件的$s1,s2,s3$

解析:我们先让$s1,s2,s3$同时在首部放入$min(a,b,c)$的’a’,然后我们以$a=min(a,b,c)$的情况进行研究:由于$LCS(s1,s3)=c$,所以我们可以继续在$s1,s3$的末尾加入$c-a$个’b’,$LCS(s2,s3)=b$,我们可以在$s2,s3$末尾加入$b-a$个’c’,此时$s1,s2,s3$满足$LCS(s1,s2)=a,LCS(s2,s3)=b,LCS(s1,s3)=c$，所以我们可以得出字符串长度$n$最小为$a+c-a+b-a=b+c-a$,最后在$s1,s2,s3$尾部分别加入不同的字符,如$s1$添加’x’，$s2$添加’y’,$s3$添加’z’至长度为$n$,其他情况同样分析即可

AcCode:

#include <iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#define int long long

using namespace std;

signed main(){
    cin.sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int a, b, c, n;
    cin >> a >> b >> c >> n;
    string str1, str2, str3;
    int arr[4] = { 0,a,b,c };
    sort(arr + 1, arr + 4);
    int lmin = arr[2] + arr[3] - arr[1];
    if (lmin > n) {
        cout << "NO" << endl;
        return 0;
    }
    for (int i = 0; i < arr[1]; i++) {
        str1.push_back('a');
        str2.push_back('a');
        str3.push_back('a');
    }
    if (arr[1] == a) {
        int len1 = b - arr[1];
        for (int i = 0; i < len1; i++) {
            str2.push_back('b');
            str3.push_back('b');
        }
        len1 = c - arr[1];
        for (int i = 0; i < len1; i++) {
            str1.push_back('c');
            str3.push_back('c');
        }
    }
    else if (arr[1] == b) {
        int len1 = c - arr[1];
        for (int i = 0; i < len1; i++) {
            str3.push_back('b');
            str1.push_back('b');
        }
        len1 = a - arr[1];
        for (int i = 0; i < len1; i++) {
            str1.push_back('c');
            str2.push_back('c');
        }
    }
    else {
        int len1 = a - arr[1];
        for (int i = 0; i < len1; i++) {
            str2.push_back('b');
            str1.push_back('b');
        }
        len1 = b - arr[1];
        for (int i = 0; i < len1; i++) {
            str2.push_back('c');
            str3.push_back('c');
        }
    }
    while (str1.length() < n) str1.push_back('d');
    while (str2.length() < n) str2.push_back('e');
    while (str3.length() < n) str3.push_back('f');
    cout << str1 << endl;
    cout << str2 << endl;
    cout << str3 << endl;

}