Permutation with exactly one pair of inverse order

20 Views Asked by At

I came up with an elementary counting problem for which I could find a simple solution. Please help.

N people of different heights line up single-file, in how many ways there is exactly one person standing immediately behind someone who is taller?