Magical Trees

In the magical world of Harry Potter, there are $N$ trees standing in a row from left to right. The $i$-th tree $(1≤i≤N)$ from the left, Tree $i$, has a magical height of $H_i$. You are a wizard tasked with cutting down all these $N$ trees in some order of your choice. You will choose a permutation $P$ of $(1,2,…,N)$ and do the following operation for each $i$=1,2,3,...,N in this order: Cut down