P1005: 序列 dp+离散化

思路

离散化之后查找最多的一个即可

Mycode

//��һ�δ��Ϻ�վ֮�� ��Ϊʹ��#define int long long TLE���¿��˺ܾõ�ʱ�� ���˼���ģ��
//����ʹ�ø��ӵ�ģ��

#include <iostream>
#include <vector>
#include <map>
#include <cstring>
#include <queue>
#include <set>
#include <algorithm>
using namespace std;
#define IOS  ios::sync_with_stdio(false);
#define CIT  cin.tie(0);
#define COT  cout.tie(0);

#define ll long long
#define x first
#define y second
#define pb push_back
#define endl '\n'
#define all(x) (x).begin(),x.end()
#define Fup(i,a,b) for(int i=a;i<=b;i++)
#define Fde(i,a,b) for(int i=a;i>=b;i--)

typedef priority_queue<int,vector<int>,greater<int>>  Pri_m;
typedef pair<int,int> pii;
typedef vector<int> VI;
map<int,int> mp;

const int N  = 1e5+10;
int n,a[N],b[N];
int f[N];

void solve()
{
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		b[i] = a[i];
	}
	
	sort(a+1,a+1+n);
	int len = unique(a+1,a+1+n)-a-1;
	
	Fup(i,1,len)
	mp[a[i]] = i ;
	
	Fup(i,1,n)
	b[i] = mp[b[i]];
	
	int maxn = 0 ;
	int ans = 0 ;
	
	Fup(i,1,n){
		int now = b[i];
		int ans = 0 ;
		if(!now){
			ans = f[0];
		}else ans =max(f[now],f[now-1]);
		++ans;
		maxn = max(maxn,ans);
		f[now] = ans;
	}
	
	cout<<n-maxn<<endl;
	

}
/**mYHeart is my algorithm**/
int main()
{
    //int t;cin>>t;while(t -- )
    solve();
    return 0;
}