codeforce 451B Sort the Array

B. Sort the Array

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Sample test(s)

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

意思就是把数组的其中一段颠倒过来后使得数组满足递增的顺序，问你是否存在这样一个片段。如果有，输出片段起点，终点，如果没有，输出no

大致思路就是把输入的数组先进行从小到大排序，然后讲排序完的数组a[n]跟起始数组b[n]进行比较，筛选出第一个不一样的点i和最后一个不一样的点j。然后在这个区间内，将a[i]跟b[j]比较，如果一样，则比较a[i+1]和b[j-1]，只要有一个不一样则退出循环，输出no.

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int start,ed;
int a[100010],b[100010];
int main()
{
    int i,n,j,judge;
    while(cin>>n)
    {
       judge=1;
       ed=start=-1;   //标记：如果数组已经是递增顺序，输出1，1.
        for(i=1;i<=n;i++)
              {
                scanf("%d",&a[i]);
               b[i]=a[i];
              }
          sort(a+1,a+n+1);
    if(a[1]!=b[1])
            start=1;
          else
             for(i=2;i<=n;i++)
                if(a[i-1]==b[i-1]&&a[i]!=b[i])              //找不一样点
                   {
                     start=i;
                     break;
                   }
    if(a[n]!=b[n])
            ed=n;
      else
             {
                 for(i=n;i>0;i--)
                  if(a[i]==b[i]&&a[i-1]!=b[i-1])
                      {
                        ed=i-1;
                        break;
                      }
             }
          if(ed==-1&&start==-1)
          {
              cout<<"yes"<<endl;
              cout<<"1"<<" "<<"1"<<endl;
          }
else
     {
      for(i=start,j=ed;i<=ed,j>=start;i++,j--)
        if(a[i]!=b[j])
            {   //cout<<"sss"<<endl;
                judge=0;
                break;
            }
    if(judge)
                {
                cout<<"yes"<<endl;
                cout<<start<<" "<<ed<<endl;
                }
            else
                    cout<<"no"<<endl;
       }
    }
    return 0;
}