UVA 10534 Wavio Sequence 最长上升子序列

Wavio Sequence

Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu

Submit  Status

Appoint description:  System Crawler  (2013-10-12)

Description

Problem D
Wavio Sequence 
Input: Standard Input

Output: Standard Output

Time Limit: 2 Seconds

 

Wavio is a sequence of integers. It has some interesting properties.

·  Wavio is of odd length i.e. L = 2*n + 1.

·  The first (n+1) integers of Wavio sequence makes a strictly increasing sequence.

·  The last (n+1) integers of Wavio sequence makes a strictly decreasing sequence.

·  No two adjacent integers are same in a Wavio sequence.

For example 1, 2, 3, 4, 5, 4, 3, 2, 0 is an Wavio sequence of length 9. But 1, 2, 3, 4, 5, 4, 3, 2, 2 is not a valid wavio sequence. In this problem, you will be given a sequence of integers. You have to find out the length of the longest Wavio sequence which is a subsequence of the given sequence. Consider, the given sequence as :

1 2 3 2 1 2 3 4 3 2 1 5 4 1 2 3 2 2 1.

Here the longest Wavio sequence is : 1 2 3 4 5 4 3 2 1. So, the output will be 9.

 

Input

The input file contains less than 75 test cases. The description of each test case is given below: Input is terminated by end of file.

 

Each set starts with a postive integer, N(1<=N<=10000). In next few lines there will be N integers.

 

Output

For each set of input print the length of longest wavio sequence in a line.

Sample Input                                   Output for Sample Input

10 1 2 3 4 5 4 3 2 1 10 19 1 2 3 2 1 2 3 4 3 2 1 5 4 1 2 3 2 2 1 5 1 2 3 4 5

9 9 1

---

Problemsetter: Md. Kamruzzaman, Member of Elite Problemsetters' Panel

#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;

const int INF=1e9;


int main()
{
    int n;
    int a[11111],b[11111],s[11111],f[11111],g[11111];
    while(scanf("%d",&n)!=EOF)
    {
        int i,k;
        for(i=1;i<=n;i++)
         {
             scanf("%d",&a[i]);
             b[n-i+1]=a[i];
         }
         memset(f,0,sizeof(f));
         memset(g,0,sizeof(g));
        for(i=1;i<=n;i++)
            s[i]=INF;
        for(i=1;i<=n;i++)
        {
            k=lower_bound(s+1,s+1+n,a[i])-s;
            f[i]=k;
            s[k]=a[i];
        }
        for(i=1;i<=n;i++)
            s[i]=INF;
        for(i=1;i<=n;i++)
        {
            k=lower_bound(s+1,s+1+n,b[i])-s;
            g[n-i+1]=k;
            s[k]=b[i];
        }
        int ans=-INF,res;
        for(i=1;i<=n;i++)
        {
           res=min(f[i],g[i]);
           res=(res-1)*2+1;
           ans=max(ans,res);
        }
        cout<<ans<<endl;
    }
    return 0;
}