Revenge of LIS II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1698 Accepted Submission(s): 574
Total Submission(s): 1698 Accepted Submission(s): 574
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.
---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
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 2HintFor 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.
题意:很简单,给你一个序列,让你求第二长单调递增子序列
分析:
我们用O(n^2)的时间求单调递增子序列的时候,里面在加一层循环维护sum数组,表示前面有几个可以转移当当前,
求前面sum的和保存到当前
最后求最后一个sum【n-1】是否为1就ok,为1的话在最长的基础上减一,否则就是最长的
#include <bits/stdc++.h>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
const long long N = 1100;
const long long Mod = 1000000007;
typedef long long LL;
int a[N], dp[N], sum[N];
int main()
{
_
int T;
cin >> T;
while (T--)
{
int n;
cin >> n;
int ma = 0;
for (int i = 0; i < n; i++)
{
cin >> a[i];
ma = max(a[i], ma);
}
a[n++] = ma + 1;
memset(sum, 0, sizeof(sum));
dp[0] = 1;
sum[0] = 1;
for (int i = 1; i < n; i++)
{
int tmp = 0;
for (int j = i - 1; j >= 0; j--)
{
if (a[i] > a[j] && dp[j] > tmp)
{
tmp = dp[j];
}
}
for (int j = i - 1; j >= 0; j--)
{
if (dp[j] == tmp && a[j] < a[i])
{
sum[i] += sum[j];
}
}
if (sum[i] == 0)
{
sum[i] = 1;
}
dp[i] = tmp + 1;
}
int ans = 0;
for (int i = 0; i < n; i++)
{
ans = max(ans, dp[i]);
}
if (sum[n - 1] == 1)
{
ans--;
}
cout << ans - 1 << endl;
}
return 0;
}