zoukankan      html  css  js  c++  java
  • Codeforces Round #396 (Div. 2) B.Mahmoud and a Triangle

    B. Mahmoud and a Triangle
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Mahmoud has n line segments, the i-th of them has length ai. Ehab challenged him to use exactly 3 line segments to form a non-degenerate triangle. Mahmoud doesn't accept challenges unless he is sure he can win, so he asked you to tell him if he should accept the challenge. Given the lengths of the line segments, check if he can choose exactly 3 of them to form a non-degenerate triangle.

    Mahmoud should use exactly 3 line segments, he can't concatenate two line segments or change any length. A non-degenerate triangle is a triangle with positive area.

    Input

    The first line contains single integer n (3 ≤ n ≤ 105) — the number of line segments Mahmoud has.

    The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 109) — the lengths of line segments Mahmoud has.

    Output

    In the only line print "YES" if he can choose exactly three line segments and form a non-degenerate triangle with them, and "NO" otherwise.

    Examples
    Input
    5
    1 5 3 2 4
    Output
    YES
    Input
    3
    4 1 2
    Output
    NO
    Note

    For the first example, he can use line segments with lengths 2, 4 and 5 to form a non-degenerate triangle.

    #include <iostream>
    #include <cstdio>
    #include <string>
    #include <set>
    #include <map>
    #include <vector>
    #include <algorithm>
    
    using namespace std;
    
    const int inf=1e5+10;
    
    vector<int> v;
    
    int main(){
        ios::sync_with_stdio(false);
        cin.tie(0);
        int n;cin>>n;
        for(int i=0;i<n;i++){
            int tem;cin>>tem;
            v.push_back(tem);
        }
        sort(v.begin(),v.end());
        for(int i=(int)v.size()-1;i>=2;i--){
            int a=v[i-2],b=v[i-1],c=v[i];
            if(a+b>c&&b+c>a&&a+c>b){
                cout<<"YES"<<endl;
                return 0;
            }
        }
        cout<<"NO"<<endl;
        return 0;
    }
  • 相关阅读:
    树状数组入门讲解
    注册鼠标右键
    马踏棋盘问题
    先有鸡还是先有蛋
    使用Python-OpenCV向图片添加噪声(高斯噪声、椒盐噪声)
    灰值形态学中的腐蚀与膨胀
    Python-OpenCV——Morphological Transformations(形态学转换)
    Python-OpenCV——Image inverting
    Python-OpenCV中的cv2.inpaint()函数
    UML类图几种关系的总结
  • 原文地址:https://www.cnblogs.com/hymscott/p/6380578.html
Copyright © 2011-2022 走看看