[Solution] End Sorted CodeChef Solution

Chef considers a permutation P$P$ of {1,2,3,…,N}$\{1,2,3,\dots ,N\}$ End Sorted if and only if P1=1$P_1=1$ and PN=N$P_N=N$.

Chef is given a permutation P$P$.

In one operation Chef can choose any index i (1≤i≤N−1)$i(1\le i\le N-1)$ and swap Pi$P_i$ and Pi+1$P_{i+1}$. Determine the minimum number of operations required by Chef to make the permutation P$P$ End Sorted.

Note: An array P$P$ is said to be a permutation of {1,2,3,…,N}$\{1,2,3,\dots ,N\}$ if P$P$ contains each element of {1,2,3,…,N}$\{1,2,3,\dots ,N\}$ exactly once.

Input Format

• The first line of input will contain a single integer T$T$, denoting the number of test cases.

Solution Click Below:-  👉CLICK HERE👈

👇👇👇👇👇

• Each test case consists of two lines of input.
• The first line of each test case contains a single integer N$N$, denoting the length of the permutation P$P$.

Similar Heights Codechef Solution

Construct N CodeChef Solution

Chef On Date CodeChef Solution

Chess Time CodeChef Solution

Minimum Coins CodeChef Solution

End Sorted CodeChef Solution

Copy and Push Back CodeChef Solution

The XOR-OR Dilemma CodeChef Solution

• The second line contains N$N$ space-separated integers P1,P2,P3,…,PN$P_1,P_2,P_3,\dots ,P_N$, denoting the permutation P$P$.

Output Format

For each test case, output minimum number of operations required by Chef to make the permutation P$P$ End Sorted.

Constraints

• 1≤T≤1000$1\le T\le 1000$
• 2≤N≤105$2\le N\le {10}^5$