[DP] POJ-2533 Longest Ordered Subsequence
2017-09-09 19:26
465 查看
Longest Ordered Subsequence
Time Limit: 2000MS Memory Limit: 65536K
Total Submissions: 55238 Accepted: 24770
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
题意:给n个数,求出最长不下降子序列
Time Limit: 2000MS Memory Limit: 65536K
Total Submissions: 55238 Accepted: 24770
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
题意:给n个数,求出最长不下降子序列
//已AC代码 #include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <cstdlib> #include <cstring> using namespace std; int a[10880]; int dp[10880]; int main() { int n; while(scanf("%d",&n)!=EOF) { memset(a,0,sizeof(a)); memset(dp,0,sizeof(dp)); int keep=0; for(int i=1;i<=n;i++) { cin>>a[i]; } for(int i=1;i<=n;i++) { dp[i]=1; for(int j=1;j<=i;j++) { if(a[i]>a[j]) { dp[i]=max(dp[i],dp[j]+1); } } } for (int i=1;i<=n;i++) { keep=max(keep,dp[i]); } cout<<keep<<endl; } return 0; }
相关文章推荐
- poj 2533 Longest Ordered Subsequence 经典DP
- 【DP|LIS】POJ-2533 Longest Ordered Subsequence(O(n^2)、O(nlogn))
- poj2533--Longest Ordered Subsequence(dp:最长上升子序列)
- poj 2533 Longest Ordered Subsequence(dp)
- POJ-2533 Longest Ordered Subsequence (线性dp 最长上升子序列)
- Longest Ordered Subsequence POJ - 2533(dp动态规划)
- POJ 2533 Longest Ordered Subsequence(dp LIS)
- POJ 2533 Longest Ordered Subsequence(DP最长上升子序列O(n^2)&&O(nlogn))
- dp基础-2 N - Longest Ordered Subsequence POJ - 2533+ HDU - 1257最少拦截系统
- POJ 2533 Longest Ordered Subsequence(dp LIS)
- POJ 2533-Longest Ordered Subsequence(DP)
- POJ2533——DP(LCS+LDS)——Longest Ordered Subsequence
- Longest Ordered Subsequence POJ - 2533 【经典DP】
- poj 2533 Longest Ordered Subsequence (DP:最长上升子序列)
- poj 动态规划DP - 2533 Longest Ordered Subsequence
- POJ2533——Longest Ordered Subsequence(简单的DP)
- POJ 2533 Longest Ordered Subsequence (DP,最长递增序列)
- DP-POJ-2533-Longest Ordered Subsequence
- POJ 2533-Longest Ordered Subsequence(DP:LIS)
- POJ 2533 Longest Ordered Subsequence(基础DP)