forked from kothariji/competitive-programming
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path(CODECHEF)INCRDEC.cpp
78 lines (76 loc) · 1.79 KB
/
(CODECHEF)INCRDEC.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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ll t;
cin>>t;
while(t--)
{
ll n;
cin>>n;
ll ar[n],i;
for(i=0;i<n;i++)
cin>>ar[i];
sort(ar,ar+n);
ll k=1,chk=1;
if(ar[n-1]==ar[n-2])
cout<<"NO\n";
else
{
for(i=0;i<n-1;i++)
{
if(ar[i]==ar[i+1])
{
k++;
chk=max(k,chk);
}
else
k=1;
}
if(chk>2)
cout<<"NO\n";
else if(chk==1)
{
cout<<"YES\n";
for(i=0;i<n;i++)
cout<<ar[i]<<" ";
cout<<"\n";
}
else
{
vector<ll>vect;
cout<<"YES\n";
i=0;
while(i<n)
{
if(ar[i]==ar[i+1])
{
vect.push_back(ar[i]);
ar[i]=0;
i+=2;
}
else
{
vect.push_back(ar[i]);
ar[i]=0;
i++;
}
}
i=n-1;
while(i>=0)
{
if(ar[i]!=0)
{
vect.push_back(ar[i]);
}
i--;
}
for(i=0;i<vect.size();i++)
cout<<vect[i]<<" ";
cout<<"\n";
}
}
}
return 0;
}