题目地址:
http://codeforces.com/problemset/problem/446/A
思路:f[i]表示到第i个数递增的数的个数,g[i]表示从第i个数开始递增的数的个数。则分三种情况讨论:(1) *...... (2) ......* (3) ......*....... 枚举i,当a[i+1]-a[i-1]>1时,表明可更改i使得该段递增,即长度为f[i-1]+g[i+1]+1(对应情况三);否则,取该段头,长度为g[i+1]+1(情况一),取该段尾,长度为f[i-1]+1(情况二),取最大值。
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=1e5+50;
const int INF=0x3f3f3f3f;
int n;
int f[maxn],g[maxn],a[maxn];
int main()
{
scanf("%d",&n);
for(int i=1; i<=n; i++)
scanf("%d",&a[i]);
a[0]=0,g[n+1]=0;
for(int i=1; i<=n; i++)
f[i]=(a[i]>a[i-1])?(f[i-1]+1):1;
for(int i=n; i>=1; i--)
g[i]=(a[i]<a[i+1])?(g[i+1]+1):1;
int ans=-INF;
for(int i=1; i<=n; i++)
{
if(a[i+1]-a[i-1]>1) ans=max(ans,f[i-1]+g[i+1]+1);
else ans=max(ans,max(g[i+1]+1,f[i-1]+1));
}
printf("%d\n",ans);
return 0;
}