Educational Codeforces Round 63 (Div.2)

A.若存在解则一定存在某个i使得a[i]>a[i+1]，翻转它即可。

 1 #include<cstdio>
 2 #include<cstring>
 3 #include<iostream>
 4 #include<algorithm>
 5 #define rep(i,l,r) for (int i=(l); i<=(r); i++)
 6 typedef long long ll;
 7 using namespace std;
 8 
 9 const int N=300010;
10 int n;
11 char s[N];
12 
13 int main(){
14     scanf("%d%s",&n,s+1);
15     rep(i,1,n-1) if (s[i]>s[i+1]){ printf("YES\n%d %d\n",i,i+1); return 0; }
16     puts("NO");
17     return 0;
18 }

A