Two integer sequences existed initially — one of them was strictly increasing, and the other one — strictly decreasing.
Strictly increasing sequence is a sequence of integers [x1<x2<⋯<xk]. And strictly decreasing sequence is a sequence of integers [y1>y2>⋯>yl]. Note that the empty sequence and the sequence consisting of one element can be considered as increasing or decreasing.
They were merged into one sequence a. After that sequence a got shuffled. For example, some of the possible resulting sequences a for an increasing sequence [1,3,4] and a decreasing sequence [10,4,2] are sequences [1,2,3,4,4,10] or [4,2,1,10,4,3].
This shuffled sequence a is given in the input.
Your task is to find any two suitable initial sequences. One of them should be strictly increasing and the other one — strictly decreasing. Note that the empty sequence and the sequence consisting of one element can be considered as increasing or decreasing.
If there is a contradiction in the input and it is impossible to split the given sequence a to increasing and decreasing sequences, print “NO”.
Input
The first line of the input contains one integer n (1≤n≤2⋅105) — the number of elements in a.
The second line of the input contains n integers a1,a2,…,an (0≤ai≤2⋅105), where ai is the i-th element of a.
Output
If there is a contradiction in the input and it is impossible to split the given sequence a to increasing and decreasing sequences, print “NO” in the first line.
Otherwise print “YES” in the first line and any two suitable sequences. Note that the empty sequence and the sequence consisting of one element can be considered as increasing or decreasing.
In the second line print ni — the number of elements in the strictly increasing sequence. ni can be zero, in this case the increasing sequence is empty.
In the third line print ni integers inc1,inc2,…,incni in the increasing order of its values (inc1<inc2<⋯<incni) — the strictly increasing sequence itself. You can keep this line empty if ni=0 (or just print the empty line).
In the fourth line print nd — the number of elements in the strictly decreasing sequence. nd can be zero, in this case the decreasing sequence is empty.
In the fifth line print nd integers dec1,dec2,…,decnd in the decreasing order of its values (dec1>dec2>⋯>decnd) — the strictly decreasing sequence itself. You can keep this line empty if nd=0 (or just print the empty line).
ni+nd should be equal to n and the union of printed sequences should be a permutation of the given sequence (in case of “YES” answer).
Examples
inputCopy
7
7 2 7 3 3 1 4
outputCopy
YES
2
3 7
5
7 4 3 2 1
inputCopy
5
4 3 1 5 3
outputCopy
YES
1
3
4
5 4 3 1
inputCopy
5
1 1 2 1 2
outputCopy
NO
inputCopy
5
0 1 2 3 4
outputCopy
YES
0
5
4 3 2 1 0
C. Two Shuffled Sequences
题意 给你包含n个元素的数组 其中有一段严格上升的序列 有一段严格下降的序列 混在一起
让你输出
做法 我们把所有元素出现次数统计一下 对原数组排个序
一旦有一个元素出现次数大于等于3次那么就直接是false因为两边都塞不下
然后出现次数为一次放上升 出现次数为两次的放下降即可
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <queue>
#include <stack>
#include <set>
#include <ctype.h>//isalpha,isdight,toupper
#include <map>
#include <sstream>
typedef long long ll;
using namespace std;
#define inf 0x3f3f3f3f
const int maxn=200000+5;
vector<int>ans,ans_;
int a[maxn];
int b[maxn];
int main(){
int n;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
}
sort(a,a+n);
bool flag=true;
for(int i=0;i<n;i++){
b[a[i]]++;
if(b[a[i]]>=2)ans.push_back(a[i]);
else ans_.push_back(a[i]);
if(b[a[i]]>=3){
flag=false;
break;
}
}
if(!flag){
printf("NO\n");
return 0;
}
printf("YES\n");
printf("%d\n",ans.size());
int sz=ans.size();
for(int i=0;i<sz;i++){
i==sz-1?printf("%d",ans[i]):printf("%d ",ans[i]);
}
printf("\n");
int sz_=ans_.size();
printf("%d\n",sz_);
for(int i=sz_-1;i>=0;i--){
i==0?printf("%d",ans_[i]):printf("%d ",ans_[i]);
}
printf("\n");
return 0;
}