题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5087
题目大意: 给你一个n个元素的序列,求出”第二长“的递增子序列的长度。
解题思路: 定义了两个数组 step[i] 表示到达i的最长子序列的长度, dp[i]表示到以i结尾的递增子序列有中走法。
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn = 1005;
int step[maxn],dp[maxn], num[maxn];
int main ()
{
int T;
scanf("%d", &T);
while(T--)
{
int n;
scanf("%d", &n);
memset(dp, 0, sizeof(dp));
memset(step, 0, sizeof(step));
dp[0] = 1;
for(int i = 1; i <= n; i++)
scanf("%d", &num[i]);
int Max = -1;
for(int i = 1; i <= n; i++)
{
for(int j = 0; j < i; j++)
{
if(num[i] > num[j])
{
if(step[j]+1 > step[i])
{
step[i] = step[j] + 1;
dp[i] = dp[j];
}
else if(step[j] + 1 == step[i])
dp[i] += dp[j];
}
}
Max = max(Max, step[i]);
}
int flag = 0;
int ok = 1;
for(int i = 1; i <= n; i++)
{
if(step[i] == Max)
{
if(dp[i] > 1) ok = 0;
else
{
if(flag) ok = 0;
flag = 1;
}
}
}
printf("%d\n", Max - ok );
}
return 0;
}