Longest Ordered Subsequence(最长上升子序列)
2016-12-10 17:14
330 查看
Longest Ordered Subsequence
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.
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
Sample Output
代码如下
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.
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
7 1 7 3 5 9 4 8
Sample Output
4
代码如下
#include <stdio.h> #include <string.h> #include <stdlib.h> #include <math.h> #include <limits.h> #include <iostream> using namespace std; #define N 1001 int a ; int l ; int main() { int i,n,j,max = 0; cin>>n; for( i =0 ; i<n; i++) cin>>a[i]; memset(l,0,sizeof(l)); // memset(r,0,sizeof(r)); l[0] =1;//最长上升子序列 for( i =1 ; i<n; i++) { l[i] =1; for(j = 0 ; j<i; j++) if(a[j]<a[i] && l[j] >=l[i]) l[i] = l[j] + 1; } // r[n-1] =1;//最长下降子序列 // for(i = n-2; i>=0; i--) // { // r[i] = 1; // for( j =n-1; j>i; j--) // if(a[i] > a[j] && r[i] <= r[j]) // r[i] = r[j] +1; // } for(i=0; i<n; i++) if(l[i]>max) max = l[i] ; cout<<max<<endl; return 0; }
相关文章推荐
- 【dp-LIS】牛客网 --最长上升子序列 POJ 2533--Longest Ordered Subsequence(LIS模板题)
- POJ - 2533 Longest Ordered Subsequence(最长上升子序列)
- POJ 2533 Longest Ordered Subsequence(LIS:最长上升子序列)
- POJ 2533 Longest Ordered Subsequence(最长上升子序列O(n*n)解法)
- poj2533-Longest Ordered Subsequence(最长上升子序列)
- POJ2533 Longest Ordered Subsequence【最长上升子序列+DP】
- 【POJ 2533】Longest Ordered Subsequence(最长上升子序列LIS)
- POJ 2533 Longest Ordered Subsequence 最长上升子序列
- poj-2533-Longest Ordered Subsequence-最长上升子序列
- poj_2533 Longest Ordered Subsequence(最长上升子序列)
- poj 2533 Longest Ordered Subsequence(LIS(最长上升子序列))
- 【POJ2533】Longest Ordered Subsequence (动态规划&最长上升子序列)
- 每日三题-Day5-A(POJ 2533 Longest Ordered Subsequence 最长上升子序列O(nlogn)解法)
- poj 2533 Longest Ordered Subsequence(最长上升子序列)
- POJ2533 Longest Ordered Subsequence (最长上升子序列)
- POJ 2533 Longest Ordered Subsequence(最长上升子序列模版)
- Longest Ordered Subsequence POJ - 2533 (最长上升子序列)
- POJ2533 -Longest Ordered Subsequence最长上升子序列-动规和nlogn二分算法详解
- POJ - 2533 Longest Ordered Subsequence —— 最长不连续上升子序列
- Longest Increasing Subsequence[LIS 最长上升子序列问题] (Longest Ordered Subsequence) POJ - 2533 队列优化