计蒜客习题：删除最小元素

 

开一个二维dp数组dp[10005][3]，第二维存储的是这个数列的两种状态所对应的最大值，和LIS思路比较像。

开始的时候忽视了全部降序的情况，后来把两个维度全部算一遍就出来了。

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
using namespace std;

#define eps         (1e-6)
#define LL          long long
#define pi          acos(-1.0)
#define ALL(a)      (a.begin(),(a.end())
#define ZERO(a)     memset(a,0,sizeof(a))
#define MINUS(a)    memset(a,0xff,sizeof(a))
#define IOS         cin.tie(0),cout.sync_with_stdio(0)
#define PRINT(a,b)  cout << "#" << (a) << " " << (b) << endl
//#define DEBUG(a,b)  cout << "$" << (a) << " " << (b) << endl
#define lin       cout << "\n--------------------\n"

const LL LLINF = 1e18+100;
const int INF = 0x3f3f3f3f;
const int MAXN = 1e4 + 5;
const int MOD = 1000000000+7;
#define esp 1e-6

int dp[MAXN][3];
int a[MAXN];

int main()
{
    int n;
    cin >> n;
    for(int i=1; i<=n; ++i){
        cin >> a[i];
    }
    
    dp[1][1] = 1;
    for(int i=2; i<=n; ++i){
        dp[i][1] = 1;
        for(int j=1; j<i; ++j){
            if(a[j] >= a[i]){
                dp[i][1] = max(dp[i][1], dp[j][1]+1);
            }
        }
        //cout << dp[i][1] << endl;
    }
    
    dp[1][2] = 1;
    for(int i=2; i<=n; ++i){
        dp[i][2] = 1;
        for(int j=1;j<i; ++j){
            if(a[j] <= a[i]){
                dp[i][2] = max(max(dp[i][2], dp[j][2]+1), dp[j][1]+1);
            }
        }
        //cout << dp[i][2] << endl;
    }
    
    int ans = 0;
    for(int i=1; i<=n; ++i){
        ans = max(dp[i][2], ans);
        ans = max(dp[i][1], ans);
    }
    cout << n - ans;
    return 0;
}