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;
    }
    

      

  • 相关阅读:
    巧用系统命令看是否中毒
    从80年代初到2003年末中国出现的街头骗术
    万象数据库新密码世界```和原来的不同了
    换网关bat
    给自己的电脑做一个O盘 -隐藏自己私密的东
    一个小恶 搞 病 毒
    诊断卡常见代码
    路由跟踪命令的用法和技巧
    block,inline和inline-block的区别
    Jquery easyui开启行编辑模式增删改操作
  • 原文地址:https://www.cnblogs.com/a972290869/p/4241378.html
Copyright © 2011-2022 走看看