GYM100608 D. Decomposable Single Word Languages

全部为同一种字符则为NO

不全部为同一字符，则可以分两种情况：①开头字母自己指向自己进行循环，②结尾字母自己指向自己进行循环，中间的直接指向后面一个即可，然后交集便是输入的字符串。

#include<bits/stdc++.h>
using namespace std;
const int MX = 111;
const int INF = 0x3f3f3f3f;
char s[55];
int dp[102][29];
void init()
{
    for(int i = 1; i <= 100; i++){
        for(int j = 0; j < 26; j++){
            dp[i][j] = INF;
        }
    }
}
int main()
{
#ifdef LOCAL
    freopen("input.txt","r",stdin);
#endif // LOCAL
    freopen("decomposable.in","r",stdin);
    freopen("decomposable.out","w",stdout);

    while(cin>>s){
        int ln = strlen(s);
        int fl = 0;
        for(int i = 1; i < ln; i++){
            if(s[i-1] != s[i]){
                fl = 1;
                break;
            }
        }
        if(!fl){
            printf("NO\n");
            continue;
        }

        int st = 1;
        printf("YES\n");
        init();
        dp[1][s[0]-'a'] = 1;

        int tp = 0;
        for(int i = 1; i < ln; i++){
            if(tp){
                dp[st][s[i]-'a'] = st+1;
                st++;
            }
            else if(s[i]!=s[0]) tp = 1, --i;
        }



        printf("%d\n%d\n%d\n",st+1,1,st);
        for(int i = 1; i <= st+1; i++){
            for(int j = 0; j < 26; j++){
                if(dp[i][j] == INF) dp[i][j] = st+1;
                printf("%d%c",dp[i][j]," \n"[j==25]);
            }
        }

        init();
        st = 1;
        int ed = ln-1;
        int ls = ed-1;
        while(s[ls] == s[ed]) --ls;
        for(int i = 0; i <= ls; i++){
            dp[st][s[i]-'a'] = st+1;
            st++;
        }
        dp[st][s[ed]-'a'] = st;
        printf("%d\n%d\n%d\n",st+1,1,st);
        for(int i = 1; i <= st+1; i++){
            for(int j = 0; j < 26; j++){
                if(dp[i][j] == INF) dp[i][j] = st+1;
                printf("%d%c",dp[i][j]," \n"[j==25]);
            }
        }
    }
    return 0;
}