Minimum Deletions To Make Sorted Array

easy
Question Solve Solutions 
1. You are given a number N representing number of elements.
2. You are given N space separated numbers representing (ELE)elements.
3. Find the minimum number of deletions/removals needed such that remaining elements are (strictly)sorted.

Input Format

A number N(number of elements) ELE1 ,ELE2 ,ELE3 ,ELE4 ,ELE5 .... ELEn (N space separated elements)

Output Format

Find the minimum number of deletions/removals. Check the sample output and question video.

Constraints

1 <= N <= 100000
1 <= Elei <= 50000

Example

Input
10
40 10 55 18 14 41 61 62 25 50
Output
5
Previous
Minimal Platforms
Next
Minimum Deletions To Make Palindromic Sequence

Related Questions

easy Is Prime easy Prime Till N easy Reverse Integer easy GCD easy Fibonacci easy Fib Till N easy Exit Point of a matrix easy Placing N Queen in a matrix easy Arranging Vowels And Consonants easy Addition Of Two Linked List easy Circular Linked List easy Sort The Absolute List easy Decimal Number From Binary Linked List easy Find the largest rectangle in a matrix easy Count Pairs Having Sum X easy Delete alternate nodes of linked list