HDU5087——Revenge of LIS II(BestCoder Round #16)

Revenge of LIS II

Problem Description
In computer science, the longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence's elements are in sorted order, lowest to highest, and in which the subsequence is as long as possible. This subsequence is not necessarily contiguous, or unique.
---Wikipedia
Today, LIS takes revenge on you, again. You mission is not calculating the length of longest increasing subsequence, but the length of the second longest increasing subsequence.
Two subsequence is different if and only they have different length, or have at least one different element index in the same place. And second longest increasing subsequence of sequence S indicates the second largest one while sorting all the increasing subsequences of S by its length.
Input
The first line contains a single integer T, indicating the number of test cases.
Each test case begins with an integer N, indicating the length of the sequence. Then N integer Ai follows, indicating the sequence.
[Technical Specification]
1. 1 <= T <= 100
2. 2 <= N <= 1000
3. 1 <= Ai <= 1 000 000 000
Output
For each test case, output the length of the second longest increasing subsequence.
Sample Input
3 2 1 1 4 1 2 3 4 5 1 1 2 2 2
Sample Output
1 3 2
Hint
For the first sequence, there are two increasing subsequence: [1], [1]. So the length of the second longest increasing subsequence is also 1, same with the length of LIS.

题目大意：

　　　　求第二长的绝对递增子序列的长度。

解题思路：

　　　　错误思路：

　　　　　　　　求出用于求最长绝对递增子序列的dp数组，sort之后输出dp[N-1]。

　　　　　　　　未考虑到dp[N]可以有多种方式构成。eg：1 1 2 就应该输出2。

　　　　正确思路：

　　　　　　　　每次求dp[i]的时候，用c[i]记录有多少种情况来构成此最优解。

　　　　　　　　求出ans=max(dp[1],dp[2]...dp[N]).

　　　　　　　　在求出 sum=sum{ c[i] | dp[i]==ans }

　　　　　　　　若sum！=1 说明最优解有多种可能的构成方式。输出ans即可。

　　　　　　　　若sum==1 输出ans-1

Code:

 1 /*************************************************************************
 2     > File Name: BestCode#16_1002.cpp
 3     > Author: Enumz
 4     > Mail: 369372123@qq.com
 5     > Created Time: 2014年11月01日 星期六 17时44分05秒
 6  ************************************************************************/
 7 
 8 #include<iostream>
 9 #include<cstdio>
10 #include<cstdlib>
11 #include<string>
12 #include<cstring>
13 #include<list>
14 #include<queue>
15 #include<stack>
16 #include<map>
17 #include<set>
18 #include<algorithm>
19 #include<cmath>
20 #include<bitset>
21 #include<climits>
22 #define MAXN 5000
23 using namespace std;
24 int dp[MAXN];
25 long long a[MAXN];
26 int flag[MAXN];
27 int main()
28 {
29     int T;
30     cin>>T;
31     while (T--)
32     {
33         int N;
34         cin>>N;
35         for (int i=1;i<=N;i++){
36             scanf("%I64d",&a[i]);
37             dp[i]=1,flag[i]=1;
38         }
39         int ans=0;
40         for (int i=1;i<=N;i++)
41         {
42             for (int j=1;j<i;j++)
43                 if (a[j]<a[i])
44                 {
45                     if (dp[i]<dp[j]+1)
46                         dp[i]=dp[j]+1,flag[i]=flag[j];
47                     else if (dp[i]==dp[j]+1)
48                         flag[i]=2;
49                 }
50             if (ans<dp[i]) ans=dp[i];
51         }
52         int sum=0;
53         for (int i=1;i<=N;i++)
54             if (ans==dp[i]) sum+=flag[i];
55         if (sum>1)
56             printf("%d\n",ans);
57         else
58             printf("%d\n",ans-1);
59     }
60     return 0;
61 }

 

转载于:https://www.cnblogs.com/Enumz/p/4068879.html