POJ2533 Longest Ordered Subsequence 【最长递增子序列】
来源:互联网 发布:jquery json数组遍历 编辑:程序博客网 时间:2024/06/05 18:56
Longest Ordered Subsequence
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 32192 Accepted: 14093
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
71 7 3 5 9 4 8
Sample Output
4
NYOJ原题
#include <stdio.h>int arr[1002], dp[1002];int main(){ int n, i, j, ans; scanf("%d", &n); for(i = 1; i <= n; ++i) scanf("%d", arr + i); dp[1] = ans = 1; for(i = 2; i <= n; ++i){ for(dp[i] = 1, j = i - 1; j >= 1; --j){ if(arr[i] > arr[j] && dp[i] <= dp[j]){ dp[i] = dp[j] + 1; if(dp[i] > ans) ans = dp[i]; } } } printf("%d\n", ans); return 0;}
0 0
- POJ2533 Longest Ordered Subsequence 【最长递增子序列】
- POJ2533 Longest Ordered Subsequence(最长递增子序列)
- Longest Ordered Subsequence(最长单调递增子序列)poj2533+动态规划
- poj2533——Longest Ordered Subsequence(最长递增子序列模板)
- POJ2533 Longest Ordered Subsequence 最长升序子序列
- 最长有序子序列 Longest Ordered Subsequence POJ2533
- poj2533--Longest Ordered Subsequence(dp:最长上升子序列)
- POJ2533 Longest Ordered Subsequence (最长上升子序列)
- poj2533 Longest Ordered Subsequence(最长上升子序列)
- 【POJ2533】Longest Ordered Subsequence(LIS-最长上升子序列/DP)
- poj2533-Longest Ordered Subsequence(最长上升子序列)
- POJ2533 Longest Ordered Subsequence【最长上升子序列+DP】
- poj2533 Longest Ordered Subsequence(最长上升子序列个数)
- AC解 - Longest Ordered Subsequence(最长递增子序列)
- poj 2533 Longest Ordered Subsequence(最长递增子序列)
- poj 2533 Longest Ordered Subsequence 最长递增子序列
- POJ 2533 Longest Ordered Subsequence(最长递增子序列)
- poj-2533 Longest Ordered Subsequence(最长递增子序列)
- strcpy和memcpy的区别
- 帝国CMS友情链接系统图文教程
- Cocos2d-x 3.1.1 在Windows下搭建Android开发环境
- HDUJ 2039 三角形
- Eclipse 安装最新SVN插件
- POJ2533 Longest Ordered Subsequence 【最长递增子序列】
- 面试算法(四十五)圆圈中最后剩下的数字
- POJ 1125 Stockbroker Grapevine (动规)
- 【solr专题之三】Solr常见异常
- 不是所有的数据都值得保存
- hdu 1999 素数筛选
- (第五天)了
- Java静态代码块的妙用
- 数据库 'xxx' 已打开,并且一次只能有一个用户访问