codeforce..Sasha and a Bit of Relax

类似于前缀和的思想。。

代码：

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<queue>
#include<map>
#include<vector>
#include<set>
#include<string>
#include<cmath>
#include<cstring>
#define ll long long
#define pb push_back
#define pm make_pair
using namespace std;
const int MAX = 2e5 + 10;
const int inf = 0x3f3f3f3f;
int arr[MAX];
int dp[2][MAX];
int main()
{
	int n , ans = 0;
	cin >> n;
	for(int i = 1 ; i <= n ; i++)
	{
		cin >> arr[i];
		if(arr[i]>arr[i-1])
		  dp[0][i] = dp[0][i-1]+1;
		else
		  dp[0][i] = 1;
	}
	for(int i = n ; i > 0 ; i--)
	{
		if(arr[i+1] > arr[i])
		  dp[1][i] = dp[1][i+1]+1;
		else
		  dp[1][i] = 1;
	}
	for(int i = 1 ; i <= n ; i++)
	{
		ans = max(ans,dp[1][i]);
		if(arr[i-1] < arr[i+1])
		  ans = max(ans,dp[0][i-1]+dp[1][i+1]);
	}
	cout << ans << endl;
	return 0;
}