func_code_string: #include <bits/stdc++.h>   using namespace std;   deque<int> d[100005];   int v[100005];   int p[100005];   pair<int, int> q[100005];   int ans = 0;   int prog = 0;   int as[100005];   unordered_map<int, int> possible[100005];   bool cmp(int a, int b) {     if (q[a].first / 300 != q[b].first / 300)       return q[a].first / 300 < q[b].first / 300;     return q[a].second < q[b].second;   }   void update(int val, int pos, int u, int c) {     if (c == -1) {       prog -= possible[val].size() <= 1;       if (u == 1) {         int cnt = d[val].front();         d[val].pop_front();         if (d[val].empty())           --ans;         else {           --possible[val][d[val].front() - cnt];           if (!possible[val][d[val].front() - cnt])             possible[val].erase(d[val].front() - cnt);         }       } else {         int cnt = d[val].back();         d[val].pop_back();         if (d[val].empty())           --ans;         else {           --possible[val][cnt - d[val].back()];           if (!possible[val][cnt - d[val].back()])             possible[val].erase(cnt - d[val].back());         }       }       if (!d[val].empty()) prog += possible[val].size() <= 1;     } else {       if (d[val].empty())         ++ans;       else         prog -= possible[val].size() <= 1;       if (u == 1) {         if (d[val].empty()) {           d[val].push_front(pos);         } else {           int cnt = d[val].front();           d[val].push_front(pos);           ++possible[val][cnt - pos];         }       } else {         if (d[val].empty()) {           d[val].push_back(pos);         } else {           int cnt = d[val].back();           d[val].push_back(pos);           ++possible[val][pos - cnt];         }       }       if (possible[val].size() <= 1) ++prog;     }   }   int main(void) {     int n, m;     ios_base ::sync_with_stdio(0);     cin >> n;     for (int i = 1; i <= n; ++i) cin >> v[i];     cin >> m;     for (int i = 1; i <= m; ++i) cin >> q[i].first >> q[i].second, p[i] = i;     sort(p + 1, p + 1 + m, cmp);     for (int i = q[p[1]].first; i <= q[p[1]].second; ++i) update(v[i], i, 1, 1);     as[p[1]] = ans + !prog;     int l = q[p[1]].first, r = q[p[1]].second;     for (int i = 2; i <= m; ++i) {       while (l > q[p[i]].first) --l, update(v[l], l, -1, 1);       while (r < q[p[i]].second) ++r, update(v[r], r, 1, 1);       while (l < q[p[i]].first) update(v[l], l, -1, -1), ++l;       while (r > q[p[i]].second) update(v[r], r, 1, -1), --r;       as[p[i]] = ans + !prog;     }     for (int i = 1; i <= m; ++i) cout << as[i] <<   n ;     return cout <<   n , 0;   }   