zoukankan      html  css  js  c++  java
  • cf 451B

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

    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<string>
    #include<cmath>
    #include<algorithm>
    #include<set>
    using namespace std;
    int n,a[100010];
    int main()
    {
          bool flag=true;
          int x=1,y,i;
          scanf("%d",&n);
          for(i=1;i<=n;i++)
                scanf("%d",&a[i]);
          for(i=1;i<n;i++)
          {
                if(a[i]>a[i+1])
                {
                      x=i;
                      break;
                }
          }
          for(i=x;i<n;i++)
          {
                if(a[i]<a[i+1])
                {
                      y=i;
                      break;
                }
          }
          if(i==n)
                y=n;
          reverse(a+x,a+y+1);
          for(i=1;i<n;i++)
          {
                if(a[i]>a[i+1])
                {
                      flag=false;
                      break;
                }
          }
          if(!flag)
                printf("no
    ");
          else
          {
                printf("yes
    ");
                printf("%d %d
    ",x,y);
          }
          return 0;
    }
    

      

  • 相关阅读:
    2.SpringBoot之返回json数据
    1.SpringBoot之Helloword 快速搭建一个web项目
    Jquery获取radio单选按钮的value与后面的文字
    JS点击事件的重叠处理(多个点击事件出现冲突)
    table中的td等长(不随内容大小变化)
    使用ocupload和POI一键上传Excel并解析导入数据库
    将博客搬至CSDN
    【解决方案】SSL证书报错:X509_check_private_key:key values mismatch
    如何设置开机自动重启脚本
    [Linux命令] Top命令详解
  • 原文地址:https://www.cnblogs.com/a972290869/p/4241378.html
Copyright © 2011-2022 走看看