PAT---A1112 Stucked Keyboard (20分)

题意

On a broken keyboard, some of the keys are always stucked. So when you type some sentences, the characters corresponding to those keys will appear repeatedly on screen for k times.

Now given a resulting string on screen, you are supposed to list all the possible stucked keys, and the original string.
键盘上的坏掉的键按下一次会输出k个对应的字符，给出一串键盘输出的字符串，找出坏掉的键，并输出原本的字符串。

思路

计数判断。最后一个字符要单独处理。注意坏掉的键要按照在字符串中的顺序输出，而不是按照升序输出，就是因为这个没注意折腾了2个小时，所以不看题目有时候会翻车。

Sample Input

3
caseee1__thiiis_iiisss_a_teeeeeest

Sample Output:

ei
case1__this_isss_a_teest

#include "bits/stdc++.h"
using namespace std;
int main(){
//     freopen("input.txt","r",stdin);
    int k; cin >> k;
    string s; cin >> s;
    map<char,bool> stucked;
    int cnt = 1;
    for (int i = 1; i < s.size(); ++i) {
        if (s[i] == s[i-1]) {
            cnt ++;
            if (cnt % k == 0){
                if (!stucked.count(s[i])) stucked[s[i]] = true;
            }
        } else  {
            if ( cnt % k) stucked[s[i-1]] = false;
            cnt = 1;
        }
        if(i == s.size() - 1 && (cnt % k) ) stucked[s[i]] = false;
    }

    map<char,int > _map;
    for(char e:s) if (stucked[e] && !_map[e]) _map[e] = 1, printf("%c",e);
    printf("\n");
    for (int i = 0; i < s.size(); ++i) {
        printf("%c",s[i]);
        if(stucked[s[i]]) i += k-1;
    }
}