poj 2533 Longest Ordered Subsequence
poj Longest Subsequence
2023-09-14 09:10:19 时间
Longest Ordered Subsequence
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 31787 | Accepted: 13903 |
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
7 1 7 3 5 9 4 8
Sample Output
4
题意:求最长子序列的长度
#include<stdio.h> int main () { int n,i,j; int t=0; int a[1006],dp[1006]; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&a[i]); dp[i]=1; } for(i=0;i<n;i++) { for(j=0;j<i;j++) { if(a[i]>a[j] && dp[i]<dp[j]+1) // a[j]和a[i]能构成一个上升子序列,然后把当前上升子序列的长度存到dp[i]中 dp[i]=dp[j]+1; } } for(i=0;i<n;i++) { if(t<dp[i]) t=dp[i]; } printf("%d\n",t); return 0; }
版权声明:本文博客原创文章。博客,未经同意,不得转载。
相关文章
- poj1142_poj是什么意思
- POJ 2606 Rabbit hunt 2780 Linearity 1118 Lining Up 解题报告
- POJ PKU 2826 An Easy Problem?! 解题报告
- The Unique MST POJ - 1679 【 最小生成树是否唯一判断 】
- Simple Problem with Integers(POJ 3486)
- 棋盘问题 ( POJ -1321 )(简单DFS)
- Catch That Cow (POJ - 3278)(简单BFS)
- Dungeon Master (POJ - 2251)【 三维 BFS 】
- Prime Path (POJ - 3126 )(BFS)
- Til the Cows Come Home ( POJ 2387) (简单最短路 Dijkstra)
- Subsequence (POJ - 3061)(尺取思想)
- Cash Machine (POJ 1276)(多重背包——二进制优化)