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>
typedef long double ld;
typedef long long ll;
#define trav(a, b) for(auto a : b)
#define sz(a) int((a).size())
#define all(a) (a).begin(), (a).end()
#define v vector
#define vl vector<ll>
#define mk make_pair
#define f first
#define s second
using namespace std;
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n;
string s;
cin >> n >> s;
int fr[26];
for(int i = 0;i < 26;i ++){
fr[i] = -1;
}
ld an = 1;
pair<int, int> ans = mk(1, 1);
for(int i = n - 1;i >= 0;i --){
fr[s[i] - 'a'] = i;
vector<int> arr;
for(int j = 0;j < 26;j ++){
if(fr[j] != -1)
arr.push_back(fr[j]);
}
sort(all(arr));
for(int j = 0;j < sz(arr);j ++){
int nxt = n - 1;
if(j != sz(arr) - 1)
nxt = arr[j + 1] - 1;
ld len = (nxt - i + 1);
ld avg = (j + 1) / len;
if(avg < an){
an = avg;
ans = mk(i + 1, nxt + 1);
}
}
}
cout << ans.f << " " << ans.s << '\n';
return 0;
}
# | 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... |