【POJ2533】Longest Ordered Subsequence (动态规划&最长上升子序列)
2017-08-09 00:52
483 查看
这里是题目
Longest Ordered Subsequence
Time Limit: 2000MS Memory Limit: 65536K
Total Submissions: 54195 Accepted: 24230
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
Longest Ordered Subsequence
Time Limit: 2000MS Memory Limit: 65536K
Total Submissions: 54195 Accepted: 24230
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<math.h> int s[1010],a[1010]; #include<string.h> #include<algorithm> using namespace std; int main() { int m,n; while(~scanf("%d",&n)) { int sum=0,temp; for(int i=0;i<n;i++) scanf("%d",&a[i]); s[0]=1; for(int i=1;i<n;i++) { temp=0; for(int j=0;j<i;j++) { if(a[i]>a[j]) if(temp<s[j]) temp=s[j]; } s[i]=temp+1; } int max=0; for(int i=0;i<n;i++) { if(max<s[i]) max=s[i]; } printf("%d\n",max); } return 0; }
相关文章推荐
- 【POJ2533】Longest Ordered Subsequence(LIS-最长上升子序列/DP)
- POJ2533 Longest Ordered Subsequence【最长上升子序列+DP】
- poj2533 Longest Ordered Subsequence(最长上升子序列)
- Poj2533 Longest Ordered Subsequence【简单DP】最长不下降子序列
- POJ 2533 Longest Ordered Subsequence(DP最长上升子序列O(n^2)&&O(nlogn))
- Longest Ordered Subsequence 最长上升子序列
- 每日三题-Day5-A(POJ 2533 Longest Ordered Subsequence 最长上升子序列O(nlogn)解法)
- POJ 2533 Longest Ordered Subsequence(最长上升子序列模版)
- POJ 2533 Longest Ordered Subsequence(最长上升子序列)
- Longest Ordered Subsequence POJ - 2533 (最长上升子序列)
- ZJU2136 Longest Ordered Subsequence - 最长上升子序列nlogn
- POJ - 2533 Longest Ordered Subsequence(最长上升子序列)
- POJ - 2533 Longest Ordered Subsequence —— 最长不连续上升子序列
- POJ 2533 Longest Ordered Subsequence 最长上升子序列
- poj 2533 Longest Ordered Subsequence (DP:最长上升子序列)
- Longest Increasing Subsequence[LIS 最长上升子序列问题] (Longest Ordered Subsequence) POJ - 2533 队列优化
- 【POJ 2533】Longest Ordered Subsequence(最长上升子序列LIS)
- poj 2533 Longest Ordered Subsequence(最长上升子序列)
- poj 2533 Longest Ordered Subsequence (最长上升子序列)
- POJ 2533-Longest Ordered Subsequence(dp_最长上升子序列)