zoukankan      html  css  js  c++  java
  • Bear and Three Balls(sort)



    Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64Submit

    Description

    Limak is a little polar bear. He has n balls, the i-th ball has size ti.

    Limak wants to give one ball to each of his three friends. Giving gifts isn't easy — there are two rules Limak must obey to make friends happy:

    • No two friends can get balls of the same size.
    • No two friends can get balls of sizes that differ by more than 2.

    For example, Limak can choose balls with sizes 45 and 3, or balls with sizes 9091 and 92. But he can't choose balls with sizes 55and 6 (two friends would get balls of the same size), and he can't choose balls with sizes 3031 and 33 (because sizes 30 and 33 differ by more than 2).

    Your task is to check whether Limak can choose three balls that satisfy conditions above.

    Input

    The first line of the input contains one integer n (3 ≤ n ≤ 50) — the number of balls Limak has.

    The second line contains n integers t1, t2, ..., tn (1 ≤ ti ≤ 1000) where ti denotes the size of the i-th ball.

    Output

    Print "YES" (without quotes) if Limak can choose three balls of distinct sizes, such that any two of them differ by no more than 2. Otherwise, print "NO" (without quotes).

    Sample Input

    Input
    4
    18 55 16 17
    
    Output
    YES
    
    Input
    6
    40 41 43 44 44 44
    
    Output
    NO
    
    Input
    8
    5 972 3 4 1 4 970 971
    
    Output

    YES

    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    using namespace std;
    int a[51];
    int main ()
    {
    int n;
    scanf("%d",&n);
        for(int i=0;i<n;i++)
        {
        scanf("%d",&a[i]);
    }
       
     sort(a,a+n);
      unique(a,a+n);
     int i;
     for(i=0;i<n;i++)
     {
      if(a[i]==a[i+1]-1&&a[i+1]==a[i+2]-1)
      {
     
      break;
     }  
     
     }
     if(i>=n)
     {
      printf("NO ");
     }
     else
     {
     printf("YES ");
     }
     
    return 0;
    }



  • 相关阅读:
    Android滑动菜单框架完全解析,教你如何一分钟实现滑动菜单特效
    Android滑动菜单特效实现,仿人人客户端侧滑效果,史上最简单的侧滑实现
    Android桌面悬浮窗效果实现,仿360手机卫士悬浮窗效果
    各产品编译及串口烧录
    C 语言代码规范
    烧录
    共享目录
    openwrt Makefile
    netfilter 参考pywj的《netfilter + nf_conntrack + iptables》
    iptables问题
  • 原文地址:https://www.cnblogs.com/kingjordan/p/12027218.html
Copyright © 2011-2022 走看看