Codeforces Round #462 (Div. 2) D-A Twisty Movement (枚举）

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 a1, a2, ..., an.

Little Tommy is among them. He would like to choose an interval [l, r] (1 ≤ l ≤ r ≤ n), then reverse al, al + 1, ..., ar 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 p1, p2, ..., pk, such that p1 < p2 < ... < pk and ap1 ≤ ap2 ≤ ... ≤ apk. 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 a1, a2, ..., an (1 ≤ ai ≤ 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

Copy

4
1 2 1 2

output

4

input

Copy

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.

【题意】

给n， n个数只有1,2组成， 翻转【L,R】后问最长不降序列长度；

【思路】

只有1,2组成，最长是1,2  那么 第一个2 出现的位置 P  【L，P】翻转使得后面的2的数目减少

【P，R】翻转使得 前面1 的数目增加

前面1的前缀和，后面2的后缀和，，  枚举p，然后 枚举 L，R 的位置， 使得 【1，L】 1的数目 + 【L，P】2的数目

【R，N】 2的数目 + 【P，R】 1的数目  之和 最大

【代码】

#include <iostream>
#include <bits/stdc++.h>
#include <stdio.h>
#define mem(a,b) memset(a,b,sizeof(a))
const int MAXN=1e5+5;
const int INF=0x3f3f3f3f;
#define SHUT ios_base::sync_with_stdio(false); cout.setf(ios::fixed); cout.precision(20); cout.tie(nullptr); cin.tie(nullptr);
using namespace std;
int a[MAXN];
int pre[MAXN];
int aft[MAXN];
int main()
{
    SHUT;
    int n;
    cin>>n;
    mem(a,0);
    for(int i=1;i<=n;i++)
        cin>>a[i];
    mem(pre,0);
    mem(aft,0);
    for(int i=1,j=n;i<=n;i++,j--)
    {
        pre[i]=pre[i-1]+(a[i]==1);
        aft[j]=aft[j+1]+(a[j]==2);
    }
    int ans=-INF;
    for(int i=1;i<=n+1;i++)
    {
        int t1=0,t2=0;
        for(int j=1;j<=i;j++) t1=max(t1,pre[j-1]+aft[j]-aft[i]);
        for(int j=i;j<=n+1;j++) t2=max(t2,aft[j]+pre[j-1]-pre[i-1]);
        ans=max(ans,t1+t2);
    }
    cout<<ans<<endl;
    return 0;
}

123

转载于:https://www.cnblogs.com/sizaif/p/9078376.html