A. Do Not Be Distracted!
输入一串字符,相同字母只可以连续出现,若连续出现后再次出现,则输出no。
标记所有出现过的字母,连续则只标记一次,若再次出现标记则输出no。
来自 https://codeforces.com/contest/1520/problem/A
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<cmath>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<iterator>
using namespace std;
typedef long long ll;
template<class T>T gcd(T a, T b) {
return b == 0 ? a : gcd(b, a % b); }
#define setpre(a) cout<<fixed<<setprecision(a)
#define memset(a) memset(a,0,sizeof(a))
#define FOR(i,m,n) for(int i=m;i<n;++i)
#define FOR_(i,a,b) for(int i=a;i>b;--i)
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define endl '\n'
#define bug cout<<"!!!\n";
#define N 200001
void solve() {
int n, num, flag = 0;
int book[30] = {
0 };
cin >> n;
string str;
cin >> str;
num = str[0] - 'A';
book[num]++;
FOR(i, 1