3 1 3 2 3 1 2
3 There are $6$ permutations of size $3$: $(1,~2,~3)$, $(1,~3,~2)$, $(2,~1,~3)$, $(2,~3,~1)$, $(3,~1,~2)$, and $(3,~2,~1)$. Among them, $(1,~3,~2)$ and $(3,~1,~2)$ come $2$\-nd and $5$\-th in lexicographical order, so the answer is $|2 - 5| = 3$.
8 7 3 5 4 2 1 6 8 3 8 2 5 4 6 7 1
17517
3 1 2 3 1 2 3
0
{
"problem": {
"name": "Count Order",
"description": {
"content": "We have two permutations $P$ and $Q$ of size $N$ (that is, $P$ and $Q$ are both rearrangements of $(1,~2,~...,~N)$). There are $N!$ possible permutations of size $N$. Among them, let $P$ and $Q$ be th",
"description_type": "Markdown"
},
"platform": "AtCoder",
"limit": {
"time_limit": 2000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "abc150_c"
},
"statements": [
{
"statement_type": "Markdown",
"content": "We have two permutations $P$ and $Q$ of size $N$ (that is, $P$ and $Q$ are both rearrangements of $(1,~2,~...,~N)$).\nThere are $N!$ possible permutations of size $N$. Among them, let $P$ and $Q$ be th...",
"is_translate": false,
"language": "English"
}
]
}