题目链接:https://www.luogu.com.cn/problem/P1091
解题思路:
主要是LIS和最长下降子序列的合并。但是如果 i 的LIS不为1而最长下降子序列为1,或者最长下降子序列不为1而LIS为1,则需要特判一下,因为在最后多加了一个 i 本身。
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<queue>
using namespace std;
#define ll int long long
int a[110];
int dp[110];
int sp[110];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
//最长不下降序列
dp[1] = 1,dp[n]=1;
for (int i = 2; i < n ; i++)
{
dp[i] = 1;
for (int j =1; j < i; j++)
{
if (a[i] > a[j] && (dp[j] + 1 > dp[i]))
dp[i] = dp[j] + 1;
}
}
//最长下降序列
sp[1] = 1, sp[n] = 1;
for (int i = n-1; i >1 ; i--)
{
sp[i] = 1;
for (int j = n; j >i; j--)
{
if (a[j]<a[i] && (sp[j] + 1>sp[i]))
sp[i] = sp[j] + 1;
}
}
int maxn = -1;
for (int i = 1; i <= n ; i++) {
int ans;
//cout << dp[i] << " " << sp[i] << endl;
if((sp[i]==1&&dp[i]!=1)||(dp[i]==1&&sp[i]!=1))//注意这里一定要特判
ans = dp[i] + sp[i] ;
else
ans = dp[i] + sp[i]-1;
if (ans > maxn)
maxn = ans;
}
printf("%d\n", n-maxn);
}
//参考题目https://www.luogu.com.cn/problem/P1091