Codeforces Round #FF (Div. 2) Problem C DZY Loves Sequences

最新推荐文章于 2022-07-13 02:01:45 发布

squee_spoon

最新推荐文章于 2022-07-13 02:01:45 发布

阅读量542

点赞数

文章标签： Codeforces Round #FF

本文链接：https://blog.csdn.net/squee_spoon/article/details/37756901

版权

DZY has a sequence a, consisting of n integers.

We'll call a sequence a_i, a_i + 1, ..., a_j (1 ≤ i ≤ j ≤ n) a subsegment of the sequence a. The value (j - i + 1) denotes the length of the subsegment.

Your task is to find the longest subsegment of a, such that it is possible to change at most one number (change one number to any integer you want) from the subsegment to make the subsegment strictly increasing.

You only need to output the length of the subsegment you find.

Input

The first line contains integer n (1 ≤ n ≤ 10⁵). The next line contains n integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁹).

Output

In a single line print the answer to the problem — the maximum length of the required subsegment.

Sample test(s)

input

6
7 2 3 1 5 6

output

Note

You can choose subsegment a₂, a₃, a₄, a₅, a₆ and change its 3rd element (that is a₄) to 4.

        题意：在一个整数序列中找这样一个子段，每一个数严格大于上一个数。你可以至多改变序列中一个数的值，问最长子段的长度。
        思路：先从前往后扫一遍，如果发现某个数不比上一个数大，把它置为上一个数+1，继续扫，如果又出现了这种情况，还原到原来的位置原来的值。再后往前扫一遍。比如sample：
    7 2 3 1 5 6
    到2的时候发现不比7大，置为8，序列是7 8 3 1 5 6，到3发现不比8大，第二次出现这种情况，还原7 2 3 1 5 6，从2开始扫。到1发现不比3大，置为4，直到最后长度是5。逆序扫同理。。

#include <iostream>
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <cstdlib>
#include <string>
#include <memory.h>
#include <vector>
#include <queue>
#include <stack>
#include <ctype.h>
#define INF 1000000000
using namespace std;

int n;
int tab[100010];
int tab2[100010];
int main(){
	while(cin>>n){
		for(int i=1;i<=n;i++){
			scanf("%d",&tab[i]);
			tab2[i]=tab[i];
		}
		
		int ans=1;
		int len=1;
		int flag=false;
		int k=0;
		int tmp=0;
		for(int i=2;i<=n;i++){
			if(tab[i]>tab[i-1]){
				len++;
			}else{
				if(!flag){
					k=i;
					tmp=tab[i];
					tab[i]=tab[i-1]+1;
					flag=true;
					len++;
				}else{
					flag=false;
					i=k;
					tab[k]=tmp;
					len=1;
				}
			}
			if(len>ans)ans=len;
		}
		
		len=1;
		flag=false;
		k=0;
		tmp=0;
		for(int i=n-1;i>=1;i--){
			if(tab2[i]<tab2[i+1]){
				len++;
			}else{
				if(!flag){
					k=i;
					tmp=tab2[i];
					tab2[i]=tab2[i+1]-1;
					flag=true;
					len++;
				}else{
					flag=false;
					i=k;
					tab2[k]=tmp;
					len=1;
				}
			}
			if(len>ans)ans=len;
		}
		cout<<ans<<endl;
	}
	return 0;
}