Erase and Rotate

AtCoder

IDabc262_f

Time2000ms

Memory256MB

Difficulty—

You are given a sequence $P = (p_1,p_2,\ldots,p_N)$ that contains $1,2,\ldots,N$ exactly once each. You may perform the following operations between $0$ and $K$ times in total in any order: * Choose one term of $P$ and remove it. * Move the last term of $P$ to the head. Find the lexicographically smallest $P$ that can be obtained as a result of the operations. ## Constraints * $1 \leq N \leq 2 \times 10^5$ * $0 \leq K \leq N-1$ * $1 \leq p_i \leq N$ * $(p_1,p_2,\ldots,p_N)$ contains $1,2,\ldots,N$ exactly once each. * All values in input are integers. ## Input Input is given from Standard Input in the following format: $N$ $K$ $p_1$ $p_2$ $\ldots$ $p_N$ [samples]

Samples

Input #1

5 3
4 5 2 3 1

Output #1

1 2 3

The following operations make $P$ equal $(1,2,3)$.

*   Removing the first term makes $P$ equal $(5,2,3,1)$.
*   Moving the last term to the head makes $P$ equal $(1,5,2,3)$.
*   Removing the second term makes $P$ equal $(1,2,3)$.

There is no way to obtain $P$ lexicographically smaller than $(1,2,3)$, so this is the answer.

Input #2

3 0
3 2 1

Output #2

3 2 1

You may be unable to perform operations.

Input #3

15 10
12 10 7 2 8 11 9 1 6 14 3 15 13 5 4

Output #3

1 3 4 7 2 8 11 9

API Response (JSON)

{
  "problem": {
    "name": "Erase and Rotate",
    "description": {
      "content": "You are given a sequence $P = (p_1,p_2,\\ldots,p_N)$ that contains $1,2,\\ldots,N$ exactly once each.   You may perform the following operations between $0$ and $K$ times in total in any order: *   Cho",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc262_f"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "You are given a sequence $P = (p_1,p_2,\\ldots,p_N)$ that contains $1,2,\\ldots,N$ exactly once each.  \nYou may perform the following operations between $0$ and $K$ times in total in any order:\n\n*   Cho...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments