LCS（21年牛客多校C题）

Let LCS(s_1,s_2) denote the length of the longest common subsequence (not necessary continuity) of string s_1and string s_2.
Now give you four integers a,b,c,na,b,c,n, you need to find three lowercase character strings s_1,s_2,s_3 satisfy that |s_1|=|s_2|=|s_3|=n
and LCS(s_1,s_2)=a, LCS(s_2,s_3)=b, LCS(s_1,s_3)=c.
输入描述:
The first line has four integers a,b,c,n.
0≤a,b,c≤n.
1≤n≤1000.
输出描述:
If there is no solution, output “NO” (without double quotation marks).
If there exists solutions, you only need to output any one: output three lines, the i-th line has one strings s_i.

示例1
输入
1 2 3 4
输出
aqcc
abpp
abcc

示例2
输入
1 2 3 3
输出
NO

AC代码：

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <vector>
#include <utility>//pair
#include <stack>
#include <string.h>
#include <string>
#include <cstring>
#include <utility>
using namespace std;
const int N = 1e5+10;
typedef pair<char,int> PII;

char s1[1100],s2[1100],s3[1100];

PII a,b,c,mi,mid,ma;
int main()
{
    char maa[30]="abcdefghijklmnopqrstuvwxyz";
    int n,t=0;
    scanf("%d%d%d%d",&a.second,&b.second,&c.second,&n);
    a.first = 'a';
    b.first = 'b';
    c.first = 'c';

    if(a.second>=b.second&&a.second>=c.second){
        ma=a;
    }else if(b.second>=a.second&&b.second>=c.second)
        ma=b;
    else
        ma=c;

    if(a.second<=b.second&&a.second<=c.second&&a.first!=ma.first){
        mi=a;
    }else if(b.second<=a.second&&b.second<=c.second&&b.first!=ma.first)
        mi=b;
    else
        mi=c;

    if((mi.first=='b'&&ma.first=='c')||(mi.first=='c'&&ma.first=='b')){
        mid=a;
    }else if((mi.first=='a'&&ma.first=='c')||(mi.first=='c'&&ma.first=='a'))
        mid=b;
    else
        mid=c;

    if(ma.second+mid.second+mi.second-2*mi.second>n){
        printf("NO\n");
        return 0;
    }

    for(int i=0;i<mi.second;i++){
        s1[i]=maa[t];
        s2[i]=maa[t];
        s3[i]=maa[t];
    }
    t++;
    if(mid.first=='a'){
        for(int i=mi.second;i<mid.second;i++){
            s1[i]=maa[t];
            s2[i]=maa[t];
        }
        t++;
        for(int i=mi.second;i<mid.second;i++)
            s3[i]=maa[t];
        t++;
    }else if(mid.first=='b'){
        for(int i=mi.second;i<mid.second;i++){
            s3[i]=maa[t];
            s2[i]=maa[t];
        }
        t++;
        for(int i=mi.second;i<mid.second;i++)
            s1[i]=maa[t];
        t++;
    }else{
        for(int i=mi.second;i<mid.second;i++){
            s1[i]=maa[t];
            s3[i]=maa[t];
        }
        t++;
        for(int i=mi.second;i<mid.second;i++)
            s2[i]=maa[t];
        t++;
    }

    if(ma.first=='a'){
        for(int i=mid.second;i<mid.second+ma.second-mi.second;i++){
            s1[i]=maa[t];
            s2[i]=maa[t];
        }
        t++;
        for(int i=mid.second;i<mid.second+ma.second-mi.second;i++)
            s3[i]=maa[t];
        t++;
    }else if(ma.first=='b'){
        for(int i=mid.second;i<mid.second+ma.second-mi.second;i++){
            s3[i]=maa[t];
            s2[i]=maa[t];
        }
        t++;
        for(int i=mid.second;i<mid.second+ma.second-mi.second;i++)
            s1[i]=maa[t];
        t++;
    }else{
        for(int i=mid.second;i<mid.second+ma.second-mi.second;i++){
            s1[i]=maa[t];
            s3[i]=maa[t];
        }
        t++;
        for(int i=mid.second;i<mid.second+ma.second-mi.second;i++)
            s2[i]=maa[t];
        t++;
    }

    for(int i=mid.second+ma.second-mi.second;i<n;i++){
        s1[i]=maa[t];
    }
    t++;
    for(int i=mid.second+ma.second-mi.second;i<n;i++){
        s2[i]=maa[t];
    }
    t++;
    for(int i=mid.second+ma.second-mi.second;i<n;i++){
        s3[i]=maa[t];
    }

    printf("%s\n%s\n%s",s1,s2,s3);
    return 0;
}