There is a set of n segments with the lengths li. Find a segment with an integer length so that it could form a non-degenerate triangle with any two segments from the set, or tell that such segment doesn't exist.
InputThe first line contains a single integer n (2 ≤ n ≤ 200000) — the number of segments in the set.
The second line contains n integers li separated by spaces (1 ≤ li ≤ 109) — the lengths of the segments in the set.
If the required segment exists, in the first line output «YES» (without quotes). In this case in the second line output a single integer x — the length of the needed segment. If there are many such segments, output any of them.
If the required segment doesn't exist, output «NO» (without quotes).
2 3 4
YES 2
3 3 4 8
YES 6
3 3 4 9
NO
能否给出一个数与所给数的任意两个构成三角形
ac代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int a[2000005];
int main()
{
int n;
while(cin>>n)
{
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
sort(a,a+n);
if(a[0]+a[1]-1<a[n-1]-a[0]+1)
printf("NO\n");
else
{
printf("YES\n");
printf("%d\n",a[0]+a[1]-1);
}
}
return 0;
}