LightOJ 1421 Wavio Sequence 最大上升子序列变形 双dp

Wavio Sequence

Description

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

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

2.      The first (n+1) integers of Wavio sequence make a strictly increasing sequence.

3.      The last (n+1) integers of Wavio sequence make a strictly decreasing sequence.

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

For example 1, 2, 3, 4, 5, 4, 3, 2, 1 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 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

Input starts with an integer T (≤ 12), denoting the number of test cases.

Each case starts with a line containing an integer N (1 ≤ N ≤ 10⁵) denoting the number of elements in the sequence. The next line contains N space separated integers between -10⁸ to 10⁸, that form the sequence.

Output

For each case, print the case number and the length of the maximum possible Wavio sequence.

Sample Input

3

10

1 2 3 4 5 4 3 2 1 10

14

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

5

1 2 3 4 5

Sample Output

Case 1: 9

Case 2: 7

Case 3: 1

    题意：按照题意求出一个对称的上升子序列的最大长度。

    分析：该题思路很容易想到，对于序列正序进行一遍最大上升子序列处理，再逆序求一次最大上升子序列。正序逆序两者中较小的就是以该点为中点可实现的序列的单边长度，最终所求长度*2-1即可。详细注释见AC代码：

#include<stdio.h>
#include<algorithm>
using namespace std;
const int maxn=100005;
const int INF=0x3f3f3f3f;
int a[maxn],b[maxn],dpa[maxn],dpb[maxn],ma[maxn],mb[maxn];
int main()
{
	//dpa 数组  i下标表示 以ai为尾数的上升子序列的最大长度
	//ma i下标表示  长度为i的上升子序列的尾数最小值
	int T,k=0;
	scanf("%d",&T);
	while(T--)
	{
		k++;
		int n;
		scanf("%d",&n);
		for(int i=0; i<n; i++)
		{
			scanf("%d",&a[i]);
			b[n-1-i]=a[i];// 逆序保存在b数组中
		}
		ma[0]=-1e8;
		ma[1]=a[0];//初始化
		dpa[0]=1;//dpa i 指的是i下标为尾数的子序列的长度
		int maxlen=1;//定义最大长度
		for(int i=1; i<n; i++)
		{
			int l=0,r=maxlen,mid;
			if(ma[maxlen]<a[i])//若不存在数比它大则加一位
			{
				ma[++maxlen]=a[i];
				dpa[i]=maxlen;//将以a[i]为尾数的子序列的最大长度更新
			}
			else
			{
				r=maxlen;
				while(l<=r)
				{
					mid=(l+r)/2;
					if(ma[mid]<a[i])
						l=mid+1;
					else
						r=mid-1;
				}//找出第一个大于a[i]的ma数组的下标
				ma[l]=a[i];//更新
				dpa[i]=l;// 更新该数的最大长度
			}
		}
		//对逆序数组重新求一遍 得到反向的lis
		mb[0]=-1e8;
		mb[1]=b[0];
		dpb[0]=1;
		maxlen=1;
		for(int i=1; i<n; i++)
		{
			int l=0,r=maxlen,mid;
			if(mb[maxlen]<b[i])
			{
				mb[++maxlen]=b[i];
				dpb[i]=maxlen;
			}
			else
			{
				r=maxlen;
				while(l<=r)
				{
					mid=(l+r)/2;
					if(mb[mid]<b[i])
						l=mid+1;
					else
						r=mid-1;
				}
				mb[l]=b[i];
				dpb[i]=l;
			}
		}
		int res=0;
		for(int i=0; i<n; i++)//较小者为其有效值  所求长度还需*2-1
			res=max(res,2*(min(dpa[i],dpb[n-i-1]))-1);
		printf("Case %d: %d\n",k,res);
	}
}

    算法基础很是欠缺，唯有多学算法多刷题，戒骄戒躁。

    特记下，以备后日回顾。