ZOJ 2136Longest Ordered Subsequence
来源:互联网 发布:淘宝客网站推广技巧 编辑:程序博客网 时间:2024/05/01 04:17
A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 < i2 < ... < iK <= N. For example, the sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, e.g., (1, 7), (3, 4, 8) and many others. All longest ordered subsequences of this sequence are of length 4, e.g., (1, 3, 5, 8).
Your program, when given the numeric sequence, must find the length of its longest ordered subsequence.
Input
The first line of input contains the length of sequence N (1 <= N <= 1000). The second line contains the elements of sequence - N integers in the range from 0 to 10000 each, separated by spaces.
Output
Output must contain a single integer - the length of the longest ordered subsequence of the given sequence.
This problem contains multiple test cases!
The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.
The output format consists of N output blocks. There is a blank line between output blocks.
Sample Input
1
7
1 7 3 5 9 4 8
Sample Output
4
最长上升子序列,数据小n^2即可
#include<bits/stdc++.h>using namespace std;const int N=1e5+10;int T,n,a[N],dp[N];int main(){ for (scanf("%d",&T);T--;) { scanf("%d",&n); for (int i=1;i<=n;i++) scanf("%d",&a[i]); int ans=1; for (int i=1;i<=n;i++) { dp[i]=1; for (int j=1;j<i;j++) { if (a[i]<=a[j]) continue; dp[i]=max(dp[i],dp[j]+1); } ans=max(ans,dp[i]); } printf("%d\n",ans); if (T) putchar(10); } return 0;}
- ZOJ 2136 Longest Ordered Subsequence
- zoj 2136 Longest Ordered Subsequence
- zoj 2136 - Longest Ordered Subsequence
- ZOJ 2136Longest Ordered Subsequence
- ZOJ 2136(Longest Ordered Subsequence)
- ZOJ 2136 Longest Ordered Subsequence 【DP】
- ZOJ 2136 Longest Ordered Subsequence(LIS)
- ZOJ Problem Set - 2136 Longest Ordered Subsequence
- zoj 2136.Longest Ordered Subsequence
- zoj 2136 Longest Ordered Subsequence(DP经典~)
- zoj 2136 Longest Ordered Subsequence 最长上升子序
- poj 2533 && zoj 2136 Longest Ordered Subsequence --- LIS模板
- zoj 2136 Longest Ordered Subsequence 最长上升子序列 新思路
- ZOJ 2136 Longest Ordered Subsequence(简单DP)
- ZOJ 1136 Longest Ordered Subsequence DP
- zoj 2136 Longest Ordered Subsequence(最长上升子序列,第二次写 = =)
- poj2553 Longest Ordered Subsequence
- 2533--Longest Ordered Subsequence
- GitHub使用步骤
- 百度云干货资源
- 1
- border的那些事——简单的颜色控制边框外观
- 安装和使用Markdown编辑器——Typora
- ZOJ 2136Longest Ordered Subsequence
- c++ std::forward
- QPS、PV与机器数量简单计算公式
- 2
- 邮件发送--局域网中配置James邮件服务器(二)
- 接口的深入理解
- C语言编程练习——冒泡排序和选择排序
- Linux进程间通信——管道
- thrift java 例子入门(hello world)