-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path1399A - Remove Smallest.cpp
54 lines (48 loc) · 1009 Bytes
/
1399A - Remove Smallest.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
// ॐ नमः शिवाय
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define mp make_pair
// Code Written By: Vikash Patel
// Codeforces Profile: https://codeforces.com/profile/vikashpatel
string solve(int a[], int n)
{
if(n == 1)
return "YES";
sort(a, a+n);
int maxi = INT_MIN;
for(int i=1; i<n; i++)
{
maxi = max(maxi, a[i]-a[i-1]);
}
if(maxi > 1)
return "NO";
return "YES";
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("/Users/vikash/Desktop/output.txt", "w", stdout);
// #endif
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
int a[n];
for(int i=0; i<n; i++)
{
cin>>a[i];
}
cout<<solve(a, n)<<endl;
}
return 0;
}