(周日賽)Sort the Array

題意：一段數字，逆置其中兩個使其遞增

Description
Being a programmer, you like arrays a lot. For your birthday, your friends have given you an array a consisting of ndistinct 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 Input
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

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

 1 #include<stdio.h>
 2 #include<algorithm>
 3 using namespace std;
 4 int main()
 5 {
 6     int n,a[1001],b[1001],i;
 7     while(~scanf("%d",&n))
 8     {
 9         for(i=1;i<=n;i++)
10         {
11             scanf("%d",&a[i]);
12             b[i]=a[i];
13         }
14         sort(b+1,b+n+1);
15         for(i=1;i<=n;i++)
16         {
17             if(a[i]!=b[i])
18             break;
19         }
20         if(i>n)
21         {
22             printf("yes\n1 1\n");
23             break;
24         }
25         int l=i;
26         for(i=n;i>=1;i--)
27         {
28             if(a[i]!=b[i-1])
29             break;
30         }
31         int r=i;
32         for(i=l;i<=r;i++)
33         {
34             if(a[i]!=b[r-(i-l)])
35                 break;
36         }
37         if(i>r)
38         printf("yes\n%d %d\n",l,r);
39         else
40         puts("no");
41     }
42     return 0;
43 }

轉載于:https://www.cnblogs.com/awsent/p/4280833.html

本文來自互聯網用戶投稿，該文觀點僅代表作者本人，不代表本站立場。本站僅提供信息存儲空間服務，不擁有所有權，不承擔相關法律責任。
如若轉載，請注明出處：http://www.pswp.cn/news/257648.shtml
繁體地址，請注明出處：http://hk.pswp.cn/news/257648.shtml
英文地址，請注明出處：http://en.pswp.cn/news/257648.shtml

如若內容造成侵權/違法違規/事實不符，請聯系多彩編程網進行投訴反饋email:809451989@qq.com，一經查實，立即刪除！