Revenge of LIS II

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 393 Accepted Submission(s): 116

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.

Source

BestCoder Round #16

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>using namespace std;int n;
int a[1100],len[1100];
bool db[1100];int main()
{int T_T;scanf("%d",&T_T);while(T_T--){memset(len,0,sizeof(len));memset(db,false,sizeof(db));scanf("%d",&n);int LIS=-1;for(int i=0;i<n;i++){scanf("%d",a+i);len[i]=1;int mxlen=-1,mxp=-1;for(int j=0;j<i;j++){if(a[j]<a[i]){if(len[j]+1>mxlen){mxlen=len[j]+1; mxp=j;}}}len[i]=max(len[i],mxlen);int c1=0;for(int j=0;j<i;j++){if(a[j]>=a[i]) continue;if(len[j]+1==len[i]){c1++;if(db[j]==true){db[i]=true;}}}if(c1>=2){db[i]=true;}}for(int i=0;i<n;i++){if(LIS<len[i]){LIS=len[i];}}bool flag=false;int c1=0;for(int i=0;i<n&&flag==false;i++){if(LIS==len[i]){if(db[i]==true) flag=true;c1++;}}if(c1>=2||flag){printf("%d\n",LIS);}else printf("%d\n",max(1,LIS-1));}return 0;
}

posted on 2017-06-07 21:24 mthoutai 阅读(...) 评论(...) 编辑收藏

转载于:https://www.cnblogs.com/mthoutai/p/6959130.html

HDOJ 5087 Revenge of LIS II DP相关推荐

BestCoder16 1002.Revenge of LIS II(hdu 5087) 解题报告
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5087 题目意思:找出第二个最长递增子序列,输出长度.就是说,假如序列为 1 1 2,第二长递增子序列是 ...
Longest Increasing Subsequence(LIS入门dp)
http://poj.org/problem?id=2533 Longest Ordered Subsequence Time Limit: 2000MS Memory Limit: 65536K D ...
poj-2336 Ferry Loading II(dp)
题目链接: Ferry Loading II Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 3946 Accepted: ...
CodeForces - 1480D2 Painting the Array II(dp)
题目链接:点击查看题目大意:给出一个长度为 nnn 的序列,现在要求拆分成两个子序列,使得两个子序列的贡献之和最小.对于一个序列的贡献就是,去掉相邻且相同的字母后的长度,即 ∑i=1n[a[i]! ...
一中OJ #1438 航线设计 | LIS 序列DP | 解题报告
一中OJ | #1438 航线设计时限 1000MS/Case 内存 64MB/Case 题目描述有一个国家被一条河划分为南北两部分,在南岸和北岸总共有N对城镇,每一城镇在对岸都有唯一的友好城镇. ...
#1560 : H国的身份证号码II(dp+矩阵快速幂)
#1560 : H国的身份证号码II 时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 H国的身份证号码是一个N位的正整数(首位不能是0).此外,由于防伪需要,一个N位正整 ...
P2782友好城市(LIS,动态规划dp）C语言版
题目描述有一条横贯东西的大河,河有笔直的南北两岸,岸上各有位置各不相同的N个城市.北岸的每个城市有且仅有一个友好城市在南岸,而且不同城市的友好城市不相同.每对友好城市都向政府申请在河上开辟一条直线航 ...
重复T次的LIS的dp Codeforces Round #323 (Div. 2) D
http://codeforces.com/contest/583/problem/D 原题:You are given an array of positive integers a1, a2, . ...
HDOJ 1002 A + B Problem II 解题报告
今天研究 1002,,,搞得半死,虽说是一道简单的题目,真正做起来绝不是很容易的... A + B Problem II Time Limit: 2000/1000 MS (Java/Others) ...

HDOJ 5087 Revenge of LIS II DP

Revenge of LIS II

HDOJ 5087 Revenge of LIS II DP相关推荐

最新文章

热门文章