Codeforces Round #704 (Div. 2), problem: (B) Card Deck,

最新推荐文章于 2021-10-09 08:52:50 发布

aisliveF

最新推荐文章于 2021-10-09 08:52:50 发布

阅读量346

点赞数 1

分类专栏：竞赛

本文链接：https://blog.csdn.net/weixin_46006714/article/details/114018258

版权

给定一个含有不同数值的卡牌堆，你需要重新排列卡牌以获得最大的顺序值。顺序值定义为每个位置的数值乘以它的逆序位置数之和。通过每次选取卡牌堆顶部的若干张卡牌并放置到新堆顶部，直到原堆为空。找出可以实现的最大顺序值的卡牌排列。

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

B. Card Deck
time limit per test1 second
memory limit per test512 megabytes
inputstandard input
outputstandard output
You have a deck of n cards, and you’d like to reorder it to a new one.

Each card has a value between 1 and n equal to pi. All pi are pairwise distinct. Cards in a deck are numbered from bottom to top, i. e. p1 stands for the bottom card, pn is the top card.

In each step you pick some integer k>0, take the top k cards from the original deck and place them, in the order they are now, on top of the new deck. You perform this operation until the original deck is empty. (Refer to the notes section for the better understanding.)

Let’s define an order of a deck as ∑i=1nnn−i⋅pi.

Given the original deck, output the deck with maximum possible order you can make using the operation above.

Input
The first line contains a single integer t (1≤t≤1000) — the number of test cases.

The first line of each test case contains the single integer n (1≤n≤105) — the size of deck you have.

The second line contains n integers p1,p2,…,pn (1≤pi≤n; pi≠pj if i≠j) — values of card in the deck from bottom to top.

It’s guaranteed that the sum of n over all test cases doesn’t exceed 105.

Output
For each test case print the deck with maximum possible order. Print values of cards in the deck from bottom to top.

If there are multiple answers, print any of them.

Example
inputCopy
4
4
1 2 3 4
5
1 5 2 4 3
6
4 2 5 3 6 1
1
1
outputCopy
4 3 2 1
5 2 4 3 1
6 1 5 3 4 2
1
Note
In the first test case, one of the optimal strategies is the