B. Sort the Array

Problem - B - Codeforces

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 ≤ 105) — the size of array a.

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

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.

Examples

input

Copy

3
3 2 1

output

Copy

yes
1 3

input

Copy

4
2 1 3 4

output

Copy

yes
1 2

input

Copy

4
3 1 2 4

output

Copy

no

input

Copy

2
1 2

output

Copy

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].

#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N=1e5+10;
ll a[N];
ll n;
ll b,e;
ll is_begin()
{
   for(ll i=2;i<=n;i++)
    {
        if(a[i]<a[i-1])
        {
            b=i-1;
            return b;
        }
    } 
    return 1;//如果没有那就从1开始
}
ll is_end()
{
    for(ll i=b+1;i<=n;i++)
    {
        if(a[i]>a[i-1])
        {
            e=i-1;
            return e;
        }
    }
    return n;//如果没有那就从n结束
}
int main()
{
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        
    }
    b=is_begin();
    e=is_end();
    sort(a+b,a+e+1);
    for(int i=2;i<=n;i++)
    {
        if(a[i]<a[i-1])
        {
            cout<<"no"<<endl;
            return 0;
        }
    }
    cout<<"yes"<<endl;
    cout<<b<<" "<<e<<endl;
    return 0;
}

题意就是说找到一段是递减的头和尾，然后看下反转过来是不是全段都是递增的，好像我写的复杂了点.....