Submission #544152

#TimeUsernameProblemLanguageResultExecution timeMemory
544152AlperenTNivelle (COCI20_nivelle)C++17
38 / 110
54 ms10824 KiB
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5, INF = 1e9 + 5; int n, nxt[N][26], ansl = 1, ansr = 1; string str; long double ans = 1; int main(){ ios_base::sync_with_stdio(false);cin.tie(NULL); cin >> n; cin >> str; str = '$' + str; fill(nxt[n + 1], nxt[n + 1] + 26, INF); for(int i = n; i >= 1; i--){ for(int j = 0; j < 26; j++){ nxt[i][j] = nxt[i + 1][j]; } nxt[i][str[i] - 'a'] = i; } for(int i = 1; i <= n; i++){ sort(nxt[i], nxt[i] + 26); for(int j = 1; j < 26; j++){ if((long double)j / (min(nxt[i][j], n + 1) - i) < ans){ ans = (long double)j / (min(nxt[i][j], n + 1) - i); ansl = i, ansr = min(nxt[i][j], n + 1) - 1; } } } cout << ansl << " " << ansr << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...