cf2019.3.31 div3 A. Diverse Strings

A. Diverse Strings
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
A string is called diverse if it contains consecutive (adjacent) letters of the Latin alphabet and each letter occurs exactly once. For example, the following strings are diverse: “fced”, “xyz”, “r” and “dabcef”. The following string are not diverse: “az”, “aa”, “bad” and “babc”. Note that the letters ‘a’ and ‘z’ are not adjacent.

Formally, consider positions of all letters in the string in the alphabet. These positions should form contiguous segment, i.e. they should come one by one without any gaps.

You are given a sequence of strings. For each string, if it is diverse, print “Yes”. Otherwise, print “No”.

Input
The first line contains integer n (1≤n≤100), denoting the number of strings to process. The following n lines contains strings, one string per line. Each string contains only lowercase Latin letters, its length is between 1 and 100, inclusive.

Output
Print n lines, one line per a string in the input. The line should contain “Yes” if the corresponding string is diverse and “No” if the corresponding string is not diverse. You can print each letter in any case (upper or lower). For example, “YeS”, “no” and “yES” are all acceptable.

Example
inputCopy
8
fced
xyz
r
dabcef
az
aa
bad
babc
outputCopy
Yes
Yes
Yes
Yes
No
No
No
No
题意：这道题就是给你一串字符串，判断其是否符合题意，如果它是连续且不出现重复则符合，输出Yes，否则输出No；
对于很多人来说应该是无敌大水题，结果把我这个蒟蒻卡了贼久，废话少说，上代码
``#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;cin>>n;
getchar();
while(n–)
{
char s[105];//容纳字符串
int a[26],b[105];//a用来统计每个字母出现次数 b容纳出现的字母的位置
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));//数组全部归零
cin>>s;//因为没有空格，所以不推荐用gets或者getline
int l=strlen(s);
if(l==1)
{
cout<<“Yes”<<endl;
continue;
}
for(int i=0;i<l;++i)
{
a[s[i]-‘a’]++;
b[i]=s[i]-‘a’;
}
sort(b,b+l);
int flag=1;//标记是否符合题意
for(int i=0;i<26;++i)
{
if(a[i]>1)
{
flag=0;
a[i]=0;
}
}
if((b[l-1]-b[0]+1) == l &&flag ==1)//b中最后一个出现的字母减去第一个的+1的值要等于字符串的总长度
cout<<“Yes”<<endl;
else
cout<<“No”<<endl;
}
return 0;
}
第一次写题解，特水的一题，结果卡了好久，写下来当作一个记忆吧