Mahmoud and a Triangle

最新推荐文章于 2022-02-19 16:43:24 发布

原创最新推荐文章于 2022-02-19 16:43:24 发布 · 339 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一个编程挑战问题，即从给定的线段中选择三个可以构成非退化三角形的线段。通过排序和特定条件判断，文章提供了一种有效的方法来解决这个问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

Example
Input
5
1 5 3 2 4
Output

YES

Input
3
4 1 2
Output

Note

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

#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
int n,a[100005],i,j,temp,flag;
while(scanf("%d",&n)!=EOF)
{
flag=0;
for(i=0;i<n;i++)
scanf("%d",&a[i]);
sort(a,a+n);
for(i=0;i<n-2;i++)
if((a[i]+a[i+1])>a[i+2]&&(a[i+2]-a[i])<a[i+1])
{
flag=1;
break;
}
if(flag)
printf("YES\n");
else
printf("NO\n");
}
return 0;
}