蛤蛤蛤（树状数组 | 二分）

传送门

裸Lis

n2 解法谁都会

下面是 nlogn 的解法

树状数组

#include <cstdio>
#include <iostream>

using namespace std;

int n, m, a[100011], b[100011], s, len, mid;

int main()
{
int i, j, k, x, y;
cin >> n;
for(i = 1; i <= n; i++)    cin >> a[i];
b[1] = a[1];
len = 1;
for(i = 2; i <= n; i++)
{
x = 1;
y = len;
while(x <= y)
{
mid = (x + y) / 2;
if(a[i] > b[mid]) x = mid + 1;
else y = mid - 1;
}
b[x] = a[i];
if(x > len) len = x;
}
cout << n - len;
return 0;
}