题解 | 字符串展开

#include <iostream>

using namespace std;

int main() {
    int a, b,c,d;
    cin>>a>>b>>c;
    string s;
    char ch;
    cin>>s;
    for (int i=0;i<s.size();i++) {
        if (s[i]=='-') {
            if (s[i-1]<=57&&s[i-1]>=48&&s[i+1]<=57&&s[i+1]>=48) {
                if (a==1||a==2) {
                    if (c==1) {
                    d=s[i+1]-s[i-1];
                    if (d<0||d==1) {
                    }else {
                        for (int j=min(s[i-1],s[i+1])+1;j<max(s[i-1],s[i+1]);j++) {
                            ch=j;
                            for (int k=1;k<=b;k++) {
                                cout<<ch;
                            }
                        }
                    }
                    }else {
                    d=s[i+1]-s[i-1];
                    if (d<0||d==1) {
                    }else {
                        for (int j=max(s[i-1],s[i+1])-1;j>min(s[i-1],s[i+1]);j--) {
                            ch=j;
                            for (int k=1;k<=b;k++) {
                                cout<<ch;
                            }
                        }
                    }
                }
                }else {
                    d=s[i+1]-s[i-1];
                    if (d<0||d==1) {
                    }else {
                        for (int j=2;j<=d;j++) {
                            for (int k=1;k<=b;k++) {
                                cout<<'*';
                            }
                        }
                    }
                }
                if (s[i-1]>s[i+1]||s[i-1]==s[i+1]) cout<<'-';
            }else if (s[i-1]<=122&&s[i-1]>=97&&s[i+1]<=122&&s[i+1]>=97) {
                if (a==1) {
                    if (c==1) {
                    d=s[i+1]-s[i-1];
                    if (d<0||d==1) {
                    }else {
                        for (int j=min(s[i-1],s[i+1])+1;j<max(s[i-1],s[i+1]);j++) {
                            ch=j;
                            for (int k=1;k<=b;k++) {
                                cout<<ch;
                            }
                        }
                    }
                    }else {
                    d=s[i+1]-s[i-1];
                    if (d<0||d==1) {
                    }else {
                        for (int j=max(s[i-1],s[i+1])-1;j>min(s[i-1],s[i+1]);j--) {
                            ch=j;
                            for (int k=1;k<=b;k++) {
                                cout<<ch;
                            }
                        }
                    }
                }
                }else if (a==3) {
                    d=s[i+1]-s[i-1];
                    if (d<0||d==1) {
                    }else {
                        for (int j=2;j<=d;j++) {
                            for (int k=1;k<=b;k++) {
                                cout<<'*';
                            }
                        }
                    }
                }else {
                    if (c==1) {
                    d=s[i+1]-s[i-1];
                    if (d<0||d==1) {
                    }else {
                        for (int j=s[i-1]-32+1;j<s[i+1]-32;j++) {
                            ch=j;
                            for (int k=1;k<=b;k++) {
                                cout<<ch;
                            }
                        }
                    }
                    }else {
                    d=s[i+1]-s[i-1];
                    if (d<0||d==1) {
                    }else {
                        for (int j=s[i+1]-32-1;j>s[i-1]-32;j--) {
                            ch=j;
                            for (int k=1;k<=b;k++) {
                                cout<<ch;
                            }
                        }
                    }
                }
                }
                if (s[i-1]>s[i+1]||s[i-1]==s[i+1]) cout<<'-';
            }else {
                cout<<'-';
            }
        }else {
            cout<<s[i];
        }
    }
}