zoukankan      html  css  js  c++  java
  • codechef AUG17 T1 Chef and Rainbow Array

    Chef and Rainbow Array Problem Code: RAINBOWA  

    Chef likes all arrays equally. But he likes some arrays more equally than others. In particular, he loves Rainbow Arrays.

    An array is Rainbow if it has the following structure:

    • First a1 elements equal 1.
    • Next a2 elements equal 2.
    • Next a3 elements equal 3.
    • Next a4 elements equal 4.
    • Next a5 elements equal 5.
    • Next a6 elements equal 6.
    • Next a7 elements equal 7.
    • Next a6 elements equal 6.
    • Next a5 elements equal 5.
    • Next a4 elements equal 4.
    • Next a3 elements equal 3.
    • Next a2 elements equal 2.
    • Next a1 elements equal 1.
    • ai can be any non-zero positive integer.
    • There are no other elements in array.

    Help Chef in finding out if the given array is a Rainbow Array or not.

    Input

    • The first line of the input contains an integer T denoting the number of test cases.
    • The first line of each test case contains an integer N, denoting the number of elements in the given array.
    • The second line contains N space-separated integers A1, A2, ..., AN denoting the elements of array.

    Output

    • For each test case, output a line containing "yes" or "no" (without quotes) corresponding to the case if the array is rainbow array or not.

    Constraints

    • 1 ≤ T ≤ 100
    • 7 ≤ N ≤ 100
    • 1 ≤ Ai ≤ 10

    Subtasks

    • Subtask 1 (100 points) : Original constraints

    Example

    Input
    3
    19
    1 2 3 4 4 5 6 6 6 7 6 6 6 5 4 4 3 2 1
    14
    1 2 3 4 5 6 7 6 5 4 3 2 1 1
    13
    1 2 3 4 5 6 8 6 5 4 3 2 1
    
    Output
    yes
    no
    no
    

    Explanation

    The first example satisfies all the conditions.

    The second example has 1 element of value 1 at the beginning and 2 elements of value 1 at the end.

    The third one has no elements with value 7 after elements with value 6.

    ————————————————————————————————————————

    cc暂时没给中文翻译 所以只好搬英文辣

    不然我简述一下题意吧

    就是要判断一个序列是否只出现并且都出现了1-7

    还要求是个回文串并且只有一个峰(也就是单峰)

  • 相关阅读:
    ajax
    ASP.net(c#)返回上一页效果(后退)代码
    审批时进行判断
    indexOf(String.indexOf 方法)判断标签是否存在
    不用代码隐藏自定义列表
    列表显示隐藏
    jq加载页面跳转指定的页面
    sharepoint2013部件保存后停留在保存页面
    Perl学习之四:语句(续)
    Perl学习之四:语句
  • 原文地址:https://www.cnblogs.com/lyzuikeai/p/7287282.html
Copyright © 2011-2022 走看看