cf934C(思维+前缀和)

看到题一直往贪心想。。感觉自己像个智障一样。。。

思维性确实是有。。不过也没那么难想。。可能还是自己智商有限。。

这题只有12，所以有必要知道2从哪里开始计数。然而麻烦的是这个计数点可能由于翻转会发生改变，所以有必要枚举翻转之后的计数点。。

再考虑翻转区间，如果在计数点外的区间进行翻转显然是没什么意义的，所以翻转区间必然包含计数点。。这样计数点就将翻转区间分为2部分，对左边只需要求2的个数，对右边只需要求1的个数。。

设翻转区间为l,r的话。。放到整个区间去，计数点左侧需要算出l左边的1的个数+l到计数点2的个数的最大值，右边同理。。而算出1/2的个数需要预处理前缀和就可以很快算出来了。。

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<cmath>
#include<stack>
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,l,r) for(int i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define inf 10000
#define mem(a) memset(a,0,sizeof(a))
#define ll long long
#define eps 1e-8
#define succ(x) (1<<x)
#define lowbit(x) (x&(-x))
#define sqr(x) ((x)*(x))
#define mid (x+y>>1)
#define NM 2000005
#define nm 100498
#define pi 3.1415926535897931
using namespace std;
ll read(){
    ll x=0,f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
    while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
    return f*x;
}






int n,a[NM],b[NM],c[NM],ans,t1,t2;
int main(){
	n=read();
	inc(i,1,n)a[i]=read();
	inc(i,1,n)b[i]=b[i-1]+(a[i]==1);
	dec(i,n,1)c[i]=c[i+1]+(a[i]==2);
	inc(i,1,n){
		t1=t2=0;
		inc(j,1,i+1)t1=max(t1,b[j-1]+c[j]-c[i+1]);
		inc(j,i,n)t2=max(t2,c[j+1]+b[j]-b[i]);
		ans=max(ans,t1+t2);
	}
	return 0*printf("%d\n",ans);
}

C. A Twisty Movement

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

A dragon symbolizes wisdom, power and wealth. On Lunar New Year's Day, people model a dragon with bamboo strips and clothes, raise them with rods, and hold the rods high and low to resemble a flying dragon.

A performer holding the rod low is represented by a 1, while one holding it high is represented by a 2. Thus, the line of performers can be represented by a sequence a₁, a₂, ..., a_n.

Little Tommy is among them. He would like to choose an interval [l, r] (1 ≤ l ≤ r ≤ n), then reverse a_l, a_l + 1, ..., a_r so that the length of the longest non-decreasing subsequence of the new sequence is maximum.

A non-decreasing subsequence is a sequence of indices p₁, p₂, ..., p_k, such that p₁ < p₂ < ... < p_k and a_p1 ≤ a_p2 ≤ ... ≤ a_pk. The length of the subsequence is k.

Input

The first line contains an integer n (1 ≤ n ≤ 2000), denoting the length of the original sequence.

The second line contains n space-separated integers, describing the original sequence a₁, a₂, ..., a_n (1 ≤ a_i ≤ 2, i = 1, 2, ..., n).

Output

Print a single integer, which means the maximum possible length of the longest non-decreasing subsequence of the new sequence.

Examples

Input

4
1 2 1 2

Output

4

Input

10
1 1 2 2 2 1 1 2 2 1

Output

9

Note

In the first example, after reversing [2, 3], the array will become [1, 1, 2, 2], where the length of the longest non-decreasing subsequence is 4.

In the second example, after reversing [3, 7], the array will become [1, 1, 1, 1, 2, 2, 2, 2, 2, 1], where the length of the longest non-decreasing subsequence is 9.