poj2533Longest Ordered Subsequence
来源:互联网 发布:mac 铃声制作软件 编辑:程序博客网 时间:2024/04/30 01:35
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
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>int a[10000],dp[10000];int main(){int n,i,j;memset(dp,0,sizeof(dp));dp[1]=1;scanf("%d",&n);for(i=1;i<=n;i++){scanf("%d",&a[i]);}for(i=2;i<=n;i++){int tmp=0;for(j=1;j<i;j++)if(a[j]<a[i])if(tmp<dp[j]){tmp=dp[j];}dp[i]=tmp+1;}int max=0;for(i=1;i<=n;i++)if(max<dp[i]) max=dp[i];printf("%d\n",max);return 0;}
0 0
- poj2533Longest Ordered Subsequence
- POJ2533Longest Ordered Subsequence
- POJ2533Longest Ordered Subsequence(LIS)
- poj2533Longest Ordered Subsequence LIS(优化)
- Codeforces Round #198 (Div. 2) D. Bubble Sort Graph poj2533Longest Ordered Subsequence
- poj2553 Longest Ordered Subsequence
- 2533--Longest Ordered Subsequence
- Longest Ordered Subsequence
- longest ordered subsequence
- Longest Ordered Subsequence
- Longest Ordered Subsequence
- Longest Ordered Subsequence (P2533)
- zoj_2136Longest Ordered Subsequence
- POJ2533:Longest Ordered Subsequence
- POJ2533--Longest Ordered Subsequence
- poj2533 Longest Ordered Subsequence
- Longest Ordered Subsequence
- poj2533 Longest Ordered Subsequence
- HadoopDoctor—TDW MapReduce诊断系统
- Cocos2d-x 3.1.1 学习日志14--CocosStudio学习必看
- 折腾数组
- jQuery+Superfish制作下拉菜单
- POJ 3041 Asteroids(最小覆盖数)
- poj2533Longest Ordered Subsequence
- UML的几种常见关系
- Qt Quick 程序下方状态栏的显示方法
- 初衷、现在
- UVA - 12002 Happy Birthday
- android 系统display 分辨率
- 断言
- Reverse Words in a String
- LeetCode | Linked List Cycle(判断链表是否有环)