fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14. int x = 1;
  15. a %= mod;
  16. while (b) {
  17. if (b & 1) x = (x * a) % mod;
  18. a = (a * a) % mod;
  19. b >>= 1;
  20. }
  21. return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. string a;
  31.  
  32. void consistency(int n){
  33.  
  34. int i = 1;
  35. while(i<n && a[i] >= a[i-1]) i++;
  36. if(i==n){
  37. cout << "NO" << endl;
  38. return;
  39. }
  40.  
  41. cout << "YES" << endl;
  42.  
  43. //* a-z -> index
  44. vector<int> mp(26, -1);
  45. for(int i=0; i<n; i++){
  46. int k = a[i]-'a';
  47. mp[k] = i;
  48.  
  49. for(int j=k+1; j<26; j++){
  50. if(mp[j] != -1 ){
  51. cout << mp[j]+1 << " " << i+1 << endl;
  52. return;
  53. }
  54. }
  55. }
  56.  
  57. }
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66. void solve() {
  67.  
  68. int n;
  69. cin>> n;
  70.  
  71. cin >> a;
  72. consistency(n);
  73.  
  74.  
  75. }
  76.  
  77.  
  78.  
  79.  
  80.  
  81. int32_t main() {
  82. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  83.  
  84. int t = 1;
  85. // cin >> t;
  86. while (t--) {
  87. solve();
  88. }
  89.  
  90. return 0;
  91. }
Success #stdin #stdout 0s 5328KB
stdin
7
abacaba
stdout
YES
2 3