Bình luận

• 
  

  0

  

  nhankiettvt  đã bình luận lúc 24, Tháng 7, 2026, 3:39

  CODE FULL AC CHO AE

  #include <algorithm>
  #include <bitset>
  #include <climits>
  #include <cmath>
  #include <cstdio>
  #include <iomanip>
  #include <iostream>
  #include <map>
  #include <queue>
  #include <set>
  #include <stack>
  #include <string>
  #include <unordered_map>
  #include <utility>
  #include <vector>
  
  using namespace std;
  
  #define pii pair&lt;int, int>
  #define pll pair&lt;ll, ll>
  #define vi vector<int>
  #define vll vector<ll>
  #define fi first
  #define se second
  #define pb push_back
  #define all(x) (x).begin(), (x).end()
  #define ll long long
  #define ull unsigned long long
  
  #define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
  #define FORD(i, a, b) for (int i = (a); i >= (b); --i)
  #define REP(i, n) for (int i = 0; i < (n); ++i)
  
  void fast_io() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
  }
  void solve() {}
  
  int main() {
    fast_io();
    freopen("BAI4.INP", "r", stdin);
    freopen("BAI4.OUT", "w", stdout);
    string s;
    cin >> s;
    unordered_map&lt;char, int> f, l;
    for (int i = 0; i < s.size(); i++) {
      if (f.find(s[i]) == f.end()) {
        f[s[i]] = i;
      }
    }
    for (int i = s.size() - 1; i >= 0; i--) {
      if (l.find(s[i]) == l.end()) {
        l[s[i]] = i;
      }
    }
    int khoang_cach = -1;
    for (char i = 'A'; i <= 'Z'; i++) {
      khoang_cach = max(khoang_cach, l[i] - f[i]);
    }
    cout << khoang_cach + 1;
    return 0;
  }