Language: C++

#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
#define Endl endl

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
#define out(args...){vector<string> a_r_g_s=s_p_l_i_t(#args, ','); e_r_r(a_r_g_s.begin(), args); }
vector<string> s_p_l_i_t(const string& s, char c) { vector<string> v; stringstream ss(s); string x; while(getline(ss,x,c)) v.emplace_back(x); return move(v);}
void e_r_r(vector<string>::iterator it) {}
template<typename T, typename... Args> void e_r_r(vector<string>::iterator it, T a, Args... args){ if(*it==" 1"||*it=="1") cerr<<endl; else cerr << it -> substr((*it)[0] == ' ', it -> length()) << " = " << a << ", "; e_r_r(++it, args...);}
const ll MOD=1e9+7;

int ok[30][512345];
int dp[20][512345];
queue<int> qs[512345];

int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
  string s;
  cin>>s;
  int n=s.size();
  fill(ok[0],ok[30],MOD);
  fill(dp[0],dp[20],MOD);
  rep(i,n) ok[s[i]-'a'][i]=i+1;
  rep(i,26)rep(j,n)if(ok[i][j]<n) MN(ok[i+1][j],ok[i][ok[i][j]]);
  vector<int> ub(n+1,26);
  rep(j,n)if(ok[26][j]==MOD){
    int t=26;
    while(ok[t][j]==MOD) --t;
    ub[j]=t;
    qs[ok[t][j]].push(j);
  }
  set<int> que;
  rep(j,n)if(ok[26][j]<=n){
    while(qs[jque].size()){
      que.insert(qs[j].front());
      qs[j].pop();
    }
  }
  while(que.size()){
    int j=*que.begin(); que.erase(*que.begin());
    int &i=ub[j];
    int f=i;
    while(i<26){
      int fl=0;
      while(1){
	if(ok[i][j]!=MOD && MN(ok[i+1][j],ok[i][ok[i][j]])) fl=1;
	int f2=0;
	while(ok[i][j]!=MOD && ok[26][ok[i][j]]!=MOD){
	  ok[i][j]=ok[26][ok[i][j]];
	  fl=1;
	  f2=1;
	}
	if(!f2) break;
      }
      if(fl==0) break;
      ++i;
    }
    if(f!=i){
      while(qs[j].size()){
	que.insert(qs[j].front());
	qs[j].pop();
      }
    }
  }
  //reps(j,5,8){cout<<s[j];rep(i,27) cout<<ok[i][j]<<",";cout<<endl;}
  rrep(i,n){
    dp[0][i]=ok[26][i];
    if(dp[0][i]!=MOD) continue;
    int t=26;
    while(ok[t][i]==MOD) --t;
  }
  rep(i,19)rep(j,n)if(dp[i][j]<n) MN(dp[i+1][j],dp[i][dp[i][j]]);
  int q;
  cin>>q;
  while(q--){
    int l,r;
    cin>>l>>r; --l;
    rrep(i,20)if(dp[i][l]<=r) l=dp[i][l];
    cout<<(l==r?"Yes":"No")<<endl;
  }
  return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:77:14: error: 'jque' was not declared in this scope; did you mean 'que'?
   77 |     while(qs[jque].size()){
      |              ^~~~
      |              que