{"trustable":true,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"panel_content\"\u003eThe inversion number of a given number sequence a1, a2, ..., an is the number of pairs (ai, aj) that satisfy i \u0026lt; j and ai \u0026gt; aj.\u003cbr\u003e\u003cbr\u003eFor a given sequence of numbers a1, a2, ..., an, if we move the first m \u0026gt;\u003d 0 numbers to the end of the seqence, we will obtain another sequence. There are totally n such sequences as the following:\u003cbr\u003e\u003cbr\u003ea1, a2, ..., an-1, an (where m \u003d 0 - the initial seqence)\u003cbr\u003ea2, a3, ..., an, a1 (where m \u003d 1)\u003cbr\u003ea3, a4, ..., an, a1, a2 (where m \u003d 2)\u003cbr\u003e...\u003cbr\u003ean, a1, a2, ..., an-1 (where m \u003d n-1)\u003cbr\u003e\u003cbr\u003eYou are asked to write a program to find the minimum inversion number out of the above sequences.\u003cbr\u003e\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"The input consists of a number of test cases. Each case consists of two lines: the first line contains a positive integer n (n \u0026lt;\u003d 5000); the next line contains a permutation of the n integers from 0 to n-1.\u003cbr\u003e"}},{"title":"Output","value":{"format":"HTML","content":"For each case, output the minimum inversion number on a single line.\u003cbr\u003e"}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e10\r\n1 3 6 9 0 8 5 7 4 2\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e16\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}