DAY1 Two Shuffled Sequences

最新推荐文章于 2020-11-02 10:59:48 发布

ArwenNi

最新推荐文章于 2020-11-02 10:59:48 发布

阅读量317

点赞数

本文链接：https://blog.csdn.net/ArwenNi/article/details/88997440

版权

题目要求找到一个混合序列的两个原始序列，一个递增，一个递减。给定混合序列后，通过排序和处理重复元素来恢复这两个序列。如果无法找到符合条件的序列，则输出'NO'。

摘要由CSDN通过智能技术生成

C. Two Shuffled Sequences

time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
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][x1<x2<⋯<xk]. And strictly decreasing sequence is a sequence of integers [y1>y2>⋯>yl][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 aa. After that sequence aa got shuffled. For example, some of the possible resulting sequences aa for an increasing sequence [1,3,4][1,3,4] and a decreasing sequence [10,4,2][10,4,2] are sequences [1,2,3,4,4,10][1,2,3,4,4,10] or [4,2,1,10,4,3][4,2,1,10,4,3].

This shuffled sequence aa is give