codefroces 791C Bear and Different Names_otherwise, the output should have a line with n ch-CSDN博客

本文链接：https://blog.csdn.net/qiuxueming_csdn/article/details/63683780

In the army, it isn't easy to form a group of soldiers that will be effective on the battlefield. The communication is crucial and thus no two soldiers should share a name (what would happen if they got an order that Bob is a scouter, if there are two Bobs?).

A group of soldiers is effective if and only if their names are different. For example, a group (John, Bob, Limak) would be effective, while groups (Gary, Bob, Gary) and (Alice, Alice) wouldn't.

You are a spy in the enemy's camp. You noticed n soldiers standing in a row, numbered 1 through n. The general wants to choose a group of k consecutive soldiers. For every k consecutive soldiers, the general wrote down whether they would be an effective group or not.

You managed to steal the general's notes, with n - k + 1 strings s1, s2, ..., sn - k + 1, each either "YES" or "NO".

The string s1 describes a group of soldiers 1 through k ("YES" if the group is effective, and "NO" otherwise).
The string s2 describes a group of soldiers 2 through k + 1.
And so on, till the string sn - k + 1 that describes a group of soldiers n - k + 1 through n.

Your task is to find possible names of n soldiers. Names should match the stolen notes. Each name should be a string that consists of between 1 and 10 English letters, inclusive. The first letter should be uppercase, and all other letters should be lowercase. Names don't have to be existing names — it's allowed to print "Xyzzzdj" or "T" for example.

Find and print any solution. It can be proved that there always exists at least one solution.

Input

The first line of the input contains two integers n and k (2 ≤ k ≤ n ≤ 50) — the number of soldiers and the size of a group respectively.

The second line contains n - k + 1 strings s1, s2, ..., sn - k + 1. The string si is "YES" if the group of soldiers i through i + k - 1 is effective, and "NO" otherwise.

Output

Find any solution satisfying all given conditions. In one line print n space-separated strings, denoting possible names of soldiers in the order. The first letter of each name should be uppercase, while the other letters should be lowercase. Each name should contain English letters only and has length from 1 to 10.

If there are multiple valid solutions, print any of them.

   Examples 
 
     input 
   
8 3
NO NO YES YES YES NO

     output 
   
Adam Bob Bob Cpqepqwer Limak Adam Bob Adam

     input 
   
9 8
YES NO

     output 
   
R Q Ccccccccc Ccocc Ccc So Strong Samples Ccc

     input 
   
3 2
NO NO

     output 
   
Na Na Na

Note

In the first sample, there are 8 soldiers. For every 3 consecutive ones we know whether they would be an effective group. Let's analyze the provided sample output:

题意：给定n个人，一个k值，然后给出n-k个判断，表示当前的位置到i（含i）后连续k个数是否符合要求，最后要求你输出一个合法的n个名字

思路：模拟暴力，当遇到YES的时候就把i+k-1的位置填一个最大值，遇到NO，就把i+k-1的位置填成 i位置对应的数

注意：n最大值50；那么大写字母不够，需要在加上小写字母组成

AC代码：

#include <iostream>
#include <cstdio>
#include <map>
#include <vector>
#include <queue>
#include <set>
#include <algorithm>
#include <cstring>

using namespace std;

int n,k;
string s[55];
int a[55];

int main() {
    cin >> n >> k;
    memset(a,0,sizeof(a));
    for(int i = 0; i < n-k+1; i++) {
        cin >> s[i];
    }
    int i = 0;
    while(i < n-k+1&&s[i][0] != 'Y') {//找出第一个YES的位置
        i++;
    }
    int mx = 1;
    for(int j = i+1; j < k+i; ++j) {//把第一个对连续的K个数填成不同的数
        a[j] = a[j-1]+1;
        mx++;
    }
    for(i = i+1;i < n-k+1;++i){
        if(s[i][0] == 'Y'){
            a[k+i-1] = mx++;
        }else{
            a[k+i-1] = a[i];
        }
    }
    for(int i = 0; i < n; ++i) {//结果输出的时候避免超过Z的值
        if(a[i]+'A' > 'Z') {
            int t = a[i]+'A' - 'Z';
            printf("%c%c ",t+'A',t+'a');
        } else {
            printf("%c ",a[i]+'A');
        }
    }
    return 0;
}