1144C C. Two Shuffled Sequences（优先队列和set的应用）

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
input
7
7 2 7 3 3 1 4
output
YES
2
3 7
5
7 4 3 2 1
input
5
4 3 1 5 3
output
YES
1
3
4
5 4 3 1
input
5
1 1 2 1 2
output
NO
input
5
0 1 2 3 4
output
YES
0

5
4 3 2 1 0
题目大意： 给出一个数n，下一行给出n个数，在这个序列中要拆分成两个子序列，一个是递增序列（不能出现相同的元素），一个是递减序列（不能出现相同的元素）。如果能拆分出来，则输出YES和两个序列的大小和数值，不能的话输出NO。
思路： 先定义一个set容器进行查重，再定义两个优先队列存储分别存未重复的数字序列和重复数字的序列，同时在重复数字序列中再用一次set进行存储，作为最后是否满足条件的依据；符合要求的话就分别输出两个队列中的数值，不符合直接输出NO。

#include <iostream>
#include <queue>
#include <set>
using namespace std;
int main() {
	int n, num, size;
	priority_queue<int, vector<int>, greater<int> > q; // 由小到大的优先队列 
	priority_queue<int> p; // 由大到小的优先队列 
	set<int> s;
	set<int> s1;
	scanf("%d", &n);
	for(int i = 0; i < n; i++) {
		size = s.size();
		scanf("%d", &num);
		s.insert(num);
		if(s.size() != size) { // 未出现重复的数字，将数字压入p队列 
			p.push(num);
		} else { // 否则压入q队列 ，同时用set对q中的数字个数进行统计 
			q.push(num);
			s1.insert(num);
		}
	}
	size = s1.size() + p.size();
	if(n == size) { // 如果两个队列的数的个数等于n，输出yes 
		printf("YES\n");
		printf("%d\n", q.size());
		if(q.size() != 0) { // q不为0时，输出序列 
			printf("%d", q.top());
			q.pop();
			while(!q.empty()) {
				printf(" %d", q.top());
				q.pop();
			}
		}
		printf("\n");
		printf("%d\n", p.size());
		if(p.size() != 0) { // p不为0时，输出序列 
			printf("%d", p.top());
			p.pop();
			while(!p.empty()) {
				printf(" %d", p.top());
				p.pop();
			}
		}
	} else {
		printf("NO");
	}
	return 0;
}