zoukankan      html  css  js  c++  java
  • (周日赛)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
    1 1
    ");
    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
    %d %d
    ",l,r);
    39         else
    40         puts("no");
    41     }
    42     return 0;
    43 }
  • 相关阅读:
    jQuery中的表单验证
    使用jQuery操作DOM对象
    jQuery中的事件和动画
    jQuery的选择器
    divise
    Word History airplay
    a前缀
    con词根
    vert词根
    quest词根
  • 原文地址:https://www.cnblogs.com/awsent/p/4280833.html
Copyright © 2011-2022 走看看