Longest Ordered Subsequence--dp水题
来源:互联网 发布:自己设计头像软件 编辑:程序博客网 时间:2024/05/17 23:10
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, 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 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.
Your program, when given the numeric sequence, must find the length of its longest ordered subsequence.
The first line of input file contains the length of sequence N. The second line contains the elements of sequence - N integers in the range from 0 to 10000 each, separated by spaces. 1 <= N <= 1000
Output file must contain a single integer - the length of the longest ordered subsequence of the given sequence.
71 7 3 5 9 4 8
4
分析:
又是最长上升子序列的模板题,套模板即可
import java.util.*;public class Main { static Scanner in = new Scanner(System.in); static int[] dp = new int[1005];; static int[] a = new int[1005]; static int n;public static void main(String[] args) {while(in.hasNext()){n = in.nextInt();for(int i=1;i<=n;i++) a[i]=in.nextInt();int ans=0; for(int i=1;i<=n;i++){ dp[i]=1; for(int j=1;j<i;j++){ if(a[j]<a[i]) dp[i]=Math.max(dp[i], dp[j]+1); } ans = Math.max(dp[i], ans); } System.out.println(ans);}}}
水水。。
阅读全文
0 0
- Longest Ordered Subsequence--dp水题
- Longest Ordered Subsequence [dp]
- Longest Ordered Subsequence --DP
- POJ_2533 Longest Ordered Subsequence(DP)
- Longest Ordered Subsequence(dp)
- Longest Ordered Subsequence(dp)
- Longest Ordered Subsequence (dp)
- POJ2533-Longest Ordered Subsequence(dp)
- ZOJ2136 Longest Ordered Subsequence【DP】
- ZOJ 2136 Longest Ordered Subsequence 【DP】
- POJ 2533 Longest Ordered Subsequence DP(LIS)
- ZOJ 1136 Longest Ordered Subsequence DP
- POJ 2533 Longest Ordered Subsequence DP
- POJ 2533 Longest Ordered Subsequence 基础dp
- POJ 2533-Longest Ordered Subsequence(DP)
- poj 2533 Longest Ordered Subsequence(dp)
- poj 2533 Longest Ordered Subsequence dp
- DP-POJ-2533-Longest Ordered Subsequence
- Unity基础,创建丶单词
- luoguP1238走迷宫
- 机器学习-文本分析
- centos7卸载自带maridb,安装mysql5.6
- 算法之路之征服上海交大的oj-Ackerman函数
- Longest Ordered Subsequence--dp水题
- linux下安装cmake
- SciPy快速入门教程
- 基于 Blink SQL 的阿里实时计算平台StreamCompute介绍
- tf.where(a,b,c)函数
- 关于这个公众号的过去和未来
- Android多渠道SDK开发心得(5)——多渠道sdk的调试
- 数据结构实验之图论十:判断给定图是否存在合法拓扑序列
- 排序算法