QLU Regular Contest 003 C. Youmu with musical sequence（最长不下降子序列）

Description
After going downstairs of the literally Tower of White Jade, Youmu is on her way to the Human Village of Gensoukyo. When she came out of the Netherworld, she met the Phantom Ensemble who are on their way to have a music performance in the Netherworld.

After greatings with each other, the leader of the Phantom Ensemble Lunasa just asked Youmu a question about the number sequence.

Which is for a certain given positive number sequence, how many numbers should we delete so that after that we can confirm the sequence non-decreasing?

non-decreasing means for a certain positive integer sequence, every next element isn’t less than the previous element.

In that way, she thinks the sequence is musical.

It is a easy question isn’t it? Youmu just answered without thinking twice, which is just leaving one number in the sequence, because it must be non-decreasing.

But Merlin, the second leader of the Phantom Ensemble, just wants to test Youmu, so she changed the problem with just adding one more constraints, which is we need to delete the minimum number of elements of the sequence, so that the left sequence is non-decreasing.

Also, this is a easy problem for Youmu, she answered it quickly, can you answer it too?
Input
First line of the input contains one positive integer N (1\le N\le10000)N(1≤N≤10000) indicates the number of the positive integer sequence.

Then next line contains NN positive integers a[i] (1\le a[i]\le10^9)a[i](1≤a[i]≤10
9
), the positive number sequence.

Output
The minimum number of elements needs deleting so that after that the sequence is non-decreasing.

Examples
input
5
1 2 3 1 3
output
1
input
5
2 2 2 2 2
output
0
Hint
In the first test case, we just remove the 1 at index 4, so the sequence becomes 1,2,3,3 it is non-decreasing.
In the second test case, the original sequence is non-decreasing, so we don’t need to delete any element.
通过题意 （就是加粗的单词和样例。。），可以发现这是一道裸到不能再裸的最长不下降子序列板子题。尤其要注意的一点是n的范围，显然n^2的做法大概率是要T掉的，所以需要用nlogn的做法来解决这道题 （大多数同学应该都会吧）。

#include <bits/stdc++.h>

using namespace std;

int n, a[100010], dp[100010];
int main(){
	scanf("%d", &n);
	for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
	int len = 0, ans;
	for(int i = 1; i <= n; i++){
		ans = upper_bound(dp + 1, dp + 1 + len, a[i]) - dp;
		if(ans > len) len++;
		dp[ans] = a[i];  
	}
	printf("%d\n", n - len);
	
	return 0;
}