Sort the Array （CF）

如有错误，欢迎大神指出！！！

太久没有写过题了，写写水题练练手…

题目：

Being a programmer, you like arrays a lot. For your birthday, your friends have given you an array a consisting of n distinct integers.

Unfortunately, the size of a is too small. You want a bigger array! Your friends agree to give you a bigger array, but only if you are able to answer the following question correctly: is it possible to sort the array a (in increasing order) by reversing exactly one segment of a? See definitions of segment and reversing in the notes.

Input

The first line of the input contains an integer n (1 ≤ n ≤ 10⁵) — the size of array a.

The second line contains n distinct space-separated integers: a[1], a[2], ..., a[n] (1 ≤ a[i] ≤ 10⁹).

Output

Print "yes" or "no" (without quotes), depending on the answer.

If your answer is "yes", then also print two space-separated integers denoting start and end (start must not be greater than end) indices of the segment to be reversed. If there are multiple ways of selecting these indices, print any of them.

Example

Input

3
3 2 1

Output

yes
1 3

Input

4
2 1 3 4

Output

yes
1 2

Input

4
3 1 2 4

Output

no

Input

2
1 2

Output

yes
1 1

Note

Sample 1. You can reverse the entire array to get [1, 2, 3], which is sorted.

Sample 3. No segment can be reversed such that the array will be sorted.

Definitions

A segment [l, r] of array a is the sequence a[l], a[l + 1], ..., a[r].

If you have an array a of size n and you reverse its segment [l, r], the array will become:

a[1], a[2], ..., a[l - 2], a[l - 1], a[r], a[r - 1], ..., a[l + 1], a[l], a[r + 1], a[r + 2], ..., a[n - 1], a[n].

题意：给一个n维的数组，判断是否有一个区间L,R进行翻转后，该数组成为递增数组，如果有多个L,R那么输出最小的区间。

解题思路：记录输入的数组，然后sort 数组，从前往后找第一个不相等的位置并记录，从后往前找第一个不相等的位置并记录。然后进行比较即可。（详细见代码。。）

ac code :

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <list>
#include <deque>
#include <queue>
#include <iterator>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
#include <cctype>
#define si1(a) scanf("%d",&a)
#define si2(a,b) scanf("%d%d",&a,&b)
#define sd1(a) scanf("%lf",&a)
#define sd2(a,b) scanf("%lf%lf",&a,&b)
#define ss1(s)  scanf("%s",s)
#define pi1(a)    printf("%d\n",a)
#define pi2(a,b)  printf("%d %d\n",a,b)
#define mset(a,b)   memset(a,b,sizeof(a))
#define forb(i,a,b)   for(int i=a;i<b;i++)
#define ford(i,a,b)   for(int i=a;i<=b;i++)
#define LL long long
#define eps 1e-8
#define INF 0x3f3f3f3f
#define mod 1000000007
#define lson l , m , rt << 1
#define rson m + 1 , r , rt << 1 | 1
using namespace std;

int main()
{
    int n;
    si1(n);
    int a[100006];
    int b[100006];
    ford(i,1,n)
    {
        si1(a[i]);
        b[i]=a[i];//记录两个数组，一个sort，一个原数组
    }
    sort(a+1,a+1+n);
    int flag=1,x[10],num=0;
    x[0]=0,x[1]=0;//L,R的区间
    ford(i,1,n)
    {
        if(a[i]!=b[i])
        {
            x[num++]=i;//记录第一个不相等的位置，即L
            break;
        }
    }
    for(int i=n;i>0;i--)
    {
        if(a[i]!=b[i])
        {
            x[num++]=i;//同上，为R
            break;
        }
    }
    if(x[0]==x[1])
    {
        printf("yes\n1 1\n");//如果已经是递增，则随意翻转
        return 0;
    }
    for(int i=x[0],j=x[1];i<=x[1];i++,j--)
    {
        if(a[j]!=b[i])//如果还有不相等的，那么代表翻转后还是不符合递增
        {
            flag=0;
            break;
        }
    }
    if(!flag)
        printf("no\n");
    else
        printf("yes\n%d %d\n",x[0],x[1]);
    return 0;
}