This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const int inf = 0x3f3f3f3f;
int a[N];
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        char x;
        cin >> x;
        a[i] = x - 'a';
    }
    int ans = inf,L = -1,R = -1;
    for (int i = 1; i <= 26; i++) {
        vector<int>cnt(30,0);
        int r = 1,tmp = 0;
        for (int l = 1; l <= n; l++) {
            if (l > 1) {
                cnt[a[l - 1]]--;
                if (cnt[a[l - 1]] == 0) tmp--;
            }
            while (r <= n && tmp < i) {
                cnt[a[r]]++;
                if (cnt[a[r]] == 1) tmp++;
                r++;
            }
            if (tmp == i && i * (R - L + 1) > ans * (r - l)) {
                ans = i;
                L = l,R = r - 1;
            }
        }
    }
    cout << L << " " << R << "\n";
}
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |