Backfront

AtCoder

IDagc024_b

Time2000ms

Memory256MB

Difficulty—

You are given a sequence $(P_1,P_2,...,P_N)$ which is a permutation of the integers from $1$ through $N$. You would like to sort this sequence in ascending order by repeating the following operation: * Choose an element in the sequence and move it to the beginning or the end of the sequence. Find the minimum number of operations required. It can be proved that it is actually possible to sort the sequence using this operation. ## Constraints * $1 \leq N \leq 2\times 10^5$ * $(P_1,P_2,...,P_N)$ is a permutation of $(1,2,...,N)$. * All values in input are integers. ## Input Input is given from Standard Input in the following format: $N$ $P_1$ $:$ $P_N$ [samples]

Samples

Input #1

Output #1

2

For example, the sequence can be sorted in ascending order as follows:

*   Move $2$ to the beginning. The sequence is now $(2,1,3,4)$.
*   Move $1$ to the beginning. The sequence is now $(1,2,3,4)$.

Input #2

Output #2

Input #3

Output #3

API Response (JSON)

{
  "problem": {
    "name": "Backfront",
    "description": {
      "content": "You are given a sequence $(P_1,P_2,...,P_N)$ which is a permutation of the integers from $1$ through $N$. You would like to sort this sequence in ascending order by repeating the following operation: ",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "agc024_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "You are given a sequence $(P_1,P_2,...,P_N)$ which is a permutation of the integers from $1$ through $N$. You would like to sort this sequence in ascending order by repeating the following operation:\n...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments