题目链接
题意:
给你一个数组,只能改变数组中一个数,找到最长严格递增子列,输出其区间长度。
思路:
1.dp,对于第i个数,用dp[i][0]保存左边严格递增区间长度(包括i),用dp[i][1]保存右边严格递增区间长度(包括i),若a[i-1] < a[i+1] - 1,则可改变a[i]来合并左右两区间。
2.预处理得到数组中所有严格递增子列并保存其起始位置k、b,当两相邻子列(1)其中任意一个子列长度为1,则可以合并。(2)前一个子列起始位置为k1,b1,后一子列起始位置为k2,b2,若a[b1] < a[k1 + 1] - 1 或 a[b1 - 1] < a[k1 ] - 1,可以合并。当一个子列不能与其他子列合并时,最多只能变为 自身长度 + 1的严格递增子列。
code1:
#include <bits/stdc++.h>
#define fi first
#define se second
#define debug(x) cout << #x << ":" << x << endl;
#define bug cout << "********" << endl;
#define rep(i,a,n) for(int i = a; i <= n; i ++)
#define per(i,a,n) for(int i = n; i >= a; i --)
using namespace std;
typedef long long ll;
const double eps = 1e-8;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double pi = acos(-1.0);
const int mod = 1000;
const int maxn = 3e5 + 10;
int s[maxn], dp[maxn][2];
int main(){
ios::sync_with_stdio(false),cin.tie(0);
int t, n;
cin >> n;
for(int i = 1; i <= n; i ++)cin >> s[i];
if(n <= 2){
cout << n << endl;
return 0;
}
s[n + 1] = inf;
int ans = 0;
for(int i = 1; i <= n; i ++){
if(s[i - 1] < s[i])dp[i][0] = dp[i - 1][0] + 1;
else dp[i][0] = 1;
}
for(int i = n; i >= 1; i --){
if(s[i] < s[i + 1])dp[i][1] = dp[i + 1][1] + 1;
else dp[i][1] = 1;
}
for(int i = 1; i <= (n - 1); i ++)ans = max(ans, dp[i][0] + 1);
for(int i = 2; i <= n; i ++)ans = max(ans, dp[i][1] + 1);
for(int i = 1; i <= n; i ++){
if(s[i - 1] < (s[i + 1] - 1))ans = max(ans, dp[i - 1][0] + dp[i + 1][1] + 1);
}
cout << ans << endl;
return 0;
}
code2:
#include <bits/stdc++.h>
#define fi first
#define se second
#define debug(x) cout << #x << ":" << x << endl;
#define bug cout << "********" << endl;
#define rep(i,a,n) for(int i = a; i <= n; i ++)
#define per(i,a,n) for(int i = n; i >= a; i --)
using namespace std;
typedef long long ll;
const double eps = 1e-8;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double pi = acos(-1.0);
const int mod = 1000;
const int maxn = 3e5 + 10;
int s[maxn];
pair<int,int> p[maxn];
int main(){
ios::sync_with_stdio(false),cin.tie(0);
int t, n;
cin >> n;
for(int i = 1; i <= n; i ++)cin >> s[i];
if(n <= 2){
cout << n << endl;
return 0;
}
int j = 1, tot = 0, pos1 ;
while(j <= n){
pos1 = j;
while(s[j] < s[j + 1] && (j + 1) <= n)j ++;
p[++ tot] = make_pair(pos1, j);//起始位置
j ++;
}
// for(int i = 1; i <= tot; i ++)cout << p[i].first << " " << p[i].second << endl;
int ans = p[1].se - p[1].fi + 1;
for(int i = 1; i < tot; i ++){
int len1 = p[i].se - p[i].fi + 1, len2 = p[i + 1].se - p[i + 1].fi + 1;
if(len1 == 1 || len2 == 1)ans= max(ans, len1 + len2);
else{
if(s[p[i].second] < (s[p[i + 1].first + 1] - 1) || s[p[i].se - 1] < (s[p[i + 1].fi] - 1))ans = max(ans, len1 + len2);
else ans = max(ans, max(len1 + 1, len2 + 1));
}
}
cout << ans << endl;
return 0;
}