POJ 2533 Longest Ordered Subsequence(最长上升子序列模版)
2017-07-19 18:18
295 查看
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
Source
Northeastern Europe 2002, Far-Eastern Subregion
求最长上升子序列
AC代码
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 52938 | Accepted: 23611 |
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
Source
Northeastern Europe 2002, Far-Eastern Subregion
求最长上升子序列
AC代码
#include<iostream> #include<cstring> #include<cstdio> using namespace std; int a[10005],dp[10005]; int main(){ int n; scanf("%d",&n); for(int i=0;i<n;i++){ scanf("%d",&a[i]); } int maxn=0; for(int i=0;i<n;i++){ dp[i]=1; for(int j=0;j<i;j++){ if(a[i]>a[j]&&dp[i]<dp[j]+1) dp[i]=dp[j]+1; }maxn=max(maxn,dp[i]); } printf("%d\n",maxn); return 0; }
相关文章推荐
- POJ 2533 Longest Ordered Subsequence 最长上升子序列
- POJ 2533 Longest Ordered Subsequence(最长上升子序列O(n*n)解法)
- 【dp-LIS】牛客网 --最长上升子序列 POJ 2533--Longest Ordered Subsequence(LIS模板题)
- POJ - 2533 Longest Ordered Subsequence —— 最长不连续上升子序列
- POJ 2533-Longest Ordered Subsequence(dp_最长上升子序列)
- POJ2533 Longest Ordered Subsequence (最长上升子序列)
- POJ 2533 Longest Ordered Subsequence(DP最长上升子序列O(n^2)&&O(nlogn))
- 每日三题-Day5-A(POJ 2533 Longest Ordered Subsequence 最长上升子序列O(nlogn)解法)
- Longest Ordered Subsequence POJ - 2533 (最长上升子序列)
- POJ - 2533 Longest Ordered Subsequence(最长上升子序列)
- poj 2533 Longest Ordered Subsequence (最长上升子序列)
- 【POJ 2533】Longest Ordered Subsequence(最长上升子序列LIS)
- POJ 2533 Longest Ordered Subsequence 最长上升子序列
- POJ 2533 Longest Ordered Subsequence(LIS:最长上升子序列)
- POJ - 2533 Longest Ordered Subsequence(最长上升子序列)
- POJ 2533 Longest Ordered Subsequence(最长上升子序列)
- poj2533-Longest Ordered Subsequence(最长上升子序列)
- poj 2533 Longest Ordered Subsequence (DP:最长上升子序列)
- Longest Ordered Subsequence - POJ 2533 最长上升子序列
- Longest Increasing Subsequence[LIS 最长上升子序列问题] (Longest Ordered Subsequence) POJ - 2533 队列优化