poj 2533 Longest Ordered Subsequence(最长上升子序列)
来源:互联网 发布:ugg淘宝旗舰店 编辑:程序博客网 时间:2024/05/17 21:06
Longest Ordered Subsequence
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 33657 Accepted: 14730
Description
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.
Input
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
Output file must contain a single integer - the length of the longest ordered subsequence of the given sequence.
Sample Input
71 7 3 5 9 4 8
Sample Output
4
最长上升子序列(不一定连续)
dp[i]表示序列从j=0到j=i的最长上升子序列的长度。
#include <stdio.h>#include <string.h>#include <iostream>using namespace std;int num[1010],dp[1010];int main(){ int n,Max; while (scanf("%d",&n)!=EOF) { Max=-1; memset(dp, 0, sizeof(dp)); for (int i=0; i<n; i++) scanf("%d",&num[i]); for (int i=0; i<n; i++) { dp[i]=1; for (int j=0; j<i; j++) { if(num[i]>num[j]) dp[i]=max(dp[i],dp[j]+1); } Max=max(dp[i],Max); } printf("%d\n",Max); } return 0;}
0 0
- poj-2533-Longest Ordered Subsequence-最长上升子序列
- poj 2533 Longest Ordered Subsequence(LIS(最长上升子序列))
- POJ 2533 Longest Ordered Subsequence 最长上升子序列
- poj 2533 Longest Ordered Subsequence(最长上升子序列)
- poj 2533 Longest Ordered Subsequence(最长上升子序列)
- Longest Ordered Subsequence - POJ 2533 最长上升子序列
- poj 2533 Longest Ordered Subsequence(最长上升子序列)
- POJ 2533 Longest Ordered Subsequence(LIS:最长上升子序列)
- POJ 2533-Longest Ordered Subsequence(dp_最长上升子序列)
- POJ 2533 Longest Ordered Subsequence(最长上升子序列)
- poj-2533 Longest Ordered Subsequence 【最长上升子序列】
- POJ - 2533 Longest Ordered Subsequence(最长上升子序列)
- poj 2533 Longest Ordered Subsequence (最长上升子序列)
- POJ 2533 Longest Ordered Subsequence(最长上升子序列)
- 【Poj 2533】 Longest Ordered Subsequence 最长上升子序列
- POJ 2533Longest Ordered Subsequence(最长上升子序列)
- Longest Ordered Subsequence 最长上升子序列
- Longest Ordered Subsequence (最长上升子序列)
- 点击按钮,盒子消失
- 【fanさんのjava之路】java基础①简介及环境变量配置
- 学java教程之String类
- 如何用C#在Asp.net中实现打开新网页而不关闭当前页
- 换肤效果
- poj 2533 Longest Ordered Subsequence(最长上升子序列)
- oracle_12505错误解决方法
- atitit. 日志系统的原则and设计and最佳实践(1)-----原理理论总结.
- Python命名规范
- poj 2309 BST(lowbit)
- js相关
- strstr() 函数的使用
- HTML特殊字符显示
- 《Programming in Lua 3》读书笔记(二十五)