Wavio Sequence +uva+最长升子序列dp（n*log（n））

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   解决方案：顺着求一次最长公共升子序列dpr[i]，在把数组逆过来求一次最长公共子序列dpl[i]，最长波浪形数据即是：max(min(dpr[i],dpl[i])*2+1) #include <iostream> #include<cstdio> using namespace std; const int maxn=100004; int dp[maxn],dpl[maxn],dpr[maxn]; int num[maxn],num1[maxn]; int main() { int n; while(~scanf("%d",&n)) { int j=n-1; for(int i=0; i<n; i++) { scanf("%d",&num[i]); num1[j--]=num[i]; } int len=1; dp[1]=num[0]; dpl[0]=1; for(int i=1; i<n; i++) { if(num[i]>dp[len]) { dp[++len]=num[i]; dpl[i]=len; } else { int right=len,left=1,mid; while(left<right) { mid=(left+right)>>1; if(dp[mid]<num[i]) { left=mid+1; } else right=mid; } { dp[right]=num[i]; dpl[i]=right; } } } len=1; dp[1]=num1[0]; dpr[0]=1; for(int i=1; i<n; i++) { if(num1[i]>dp[len]) { dp[++len]=num1[i]; dpr[i]=len; } else { int right=len,left=1,mid; while(left<right) { mid=(left+right)>>1; if(dp[mid]<num1[i]) { left=mid+1; } else right=mid; } { dp[right]=num1[i]; dpr[i]=right; } } } int Max=0; for(int i=0; i<n; i++) { if(Max<(min(dpl[i],dpr[n-i-1])-1)*2+1) {Max=(min(dpl[i],dpr[n-i-1])-1)*2+1; // cout<<i<<endl; } } printf("%d\n",Max); //printf("%d\n",len); } return 0; }

9 9 1