这是一道神奇的不能算是dp的dp,意思是给你一个序列,问你最多删去一个数是的严格递增的数组的最大长度是多少, 很简单,记录一下每个递增数组所属第几个子数组,并且最后再预处理一遍初值,再遍历一遍即可
题目:
ac代码:
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
const int N = 2e5 + 10;
typedef long long int LL ;
LL a[N];
LL f[N];
int id[N];
LL now[N];
int main()
{
int n;
cin >> n ;
for(int i = 1; i <= n ; i ++)cin >> a[i];
LL maxd = 0 ;
a[0] = 1e17;
int cnt = 0 ;
for(int i = 1; i <= n ; i ++)
{
if(a[i] > a[i-1])f[i] = f[i-1] + 1,id[i] = id[i-1];
else f[i] = 1,id[i] = ++cnt;
maxd = max(maxd,f[i]);
}
for(int i = n ; i >= 1; i --)
{
int j = i;
while(a[j] > a[j-1])j--;
for(int h = j ; h <= i ; h ++)f[h] = f[i];
i = j ;
}
// cout<<endl <<endl;
for(int i = 1; i <= n ; i ++)
{
if(i + 2 <= n && a[i] < a[i + 2] && id[i] != id[i + 2])
{
// cout << i <<' '<<f[i]<<' '<<f[i+2]<<' '<<id[i]<<' '<<id[i+2]<<endl;
maxd = max(maxd,f[i] + f[i + 2]-1);
}
}
cout << maxd <<endl;
}