SP17955 DOSA - Lalith Dosa

Lalith is going to have dinner and he has N dosas in front of him with their prices represented by sequence of integers a1,a2,a3...an.

The first line of the test case contains an integer N - the number of dosas. The next line contains N space separated integers where the ith integer is ai , representing thr price of i-th dosa.

Output the minimal number of prices(integers) that should be replaced to make the sequence strictly increasing.