Codeforces Round #731 (Div. 3), problem: (B) Alphabetical Strings

#include <bits/stdc++.h>
#include <algorithm>
#include <math.h>
#include<string>
#include<vector>

#define pi acos(-1.0)
#define ll long long int
#define sc scanf
#define pf printf
#define fin for(ll i=0; i<n; i++)
#define fjm for(ll j=0; j<m; j++)
#define fr(i,a,n) for(ll i=a; i<n; i++)
#define rf(i,n,a) for(ll i=n-1; i>=a; i--)
#define readfirst() (ios_base:: sync_with_stdio(false),cin.tie(NULL));

using namespace std;

ll gcd(ll p, ll q) {
    return q==0?p:gcd(q,p%q);
}

int main() {
    readfirst();
    ll t, n;
    string s, out;
    cin >> t;
    while(t--) {
        cin >> s;
        n=s.size();
        out="YES";
        vector<bool> v(26,0);
        for(char c:s) {v[c-'a']=1;}
        fin {if(v[i]!=1) out="NO";}
        fr(i,1,n-1) {if(s[i]>s[i-1] && s[i]>s[i+1]) out="NO";}
        cout << out << "\n";
    }
    return 0;
}