Two Merged Sequences CodeForces - 1144G（贪心）

B - Two Merged Sequences CodeForces - 1144G

Two integer sequences existed initially, one of them was strictly increasing, and another 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.

Elements of increasing sequence were inserted between elements of the decreasing one (and, possibly, before its first element and after its last element) without changing the order. For example, sequences [1,3,4] and [10,4,2] can produce the following resulting sequences: [10,1,3,4,2,4], [1,3,4,10,4,2]. The following sequence cannot be the result of these insertions: [1,10,4,4,3,2] because the order of elements in the increasing sequence was changed.

Let the obtained sequence be a. This 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 another 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 into one increasing sequence and one decreasing sequence, 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 into one increasing sequence and one decreasing sequence, print “NO” in the first line.

Otherwise print “YES” in the first line. In the second line, print a sequence of n integers res1,res2,…,resn, where resi should be either 0 or 1 for each i from 1 to n. The i-th element of this sequence should be 0 if the i-th element of a belongs to the increasing sequence, and 1 otherwise. Note that the empty sequence and the sequence consisting of one element can be considered as increasing or decreasing.

Examples
Input
9
5 1 3 6 8 2 9 0 10
Output
YES
1 0 0 0 0 1 0 1 0
Input
5
1 2 4 0 2
Output
NO

题意：给你n个数，问你这n个数能否被分成一个严格递增子串和一个严格递减子串。

思路：贪心，代码很简单，直接看就行。

#include<cstdio>
#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<map>
#include<queue>
using namespace std;
typedef long long ll;
const int MAXN = 1e5 + 10;
const int INF = 0x3f3f3f3f;
const int maxn = 2e5+10;

int n;
int a[maxn];
int ans[maxn];
int main()
{
	scanf("%d",&n);
	for(int i=0;i<n;i++)
		scanf("%d",&a[i]);
	int inc=-INF,dec=INF;
	for(int i=0;i<n;i++)
	{
		if(a[i]<dec&&a[i]>inc)
		{
			if(a[i]<a[i+1])
				inc=a[i];
			else
			{
				dec=a[i];
				ans[i]=1;
			}
		}
		else if(a[i]<dec)
		{
			dec=a[i];
			ans[i]=1;
		}
		else if(a[i]>inc)
			inc=a[i];
		else
		{
			printf("NO\n");
			return 0;
		}
	}
	printf("YES\n");
	for(int i=0;i<n;i++)
		printf("%d ",ans[i]);
	printf("\n");

	return 0;

}