动态规划 Longest Ordered Subsequence
来源:互联网 发布:剑三文王套外观数据 编辑:程序博客网 时间:2024/05/21 19:25
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
这个题只要求出最长上升子序列就行了
#include<stdio.h>#include<string.h>int str[1001];int max[1001];int main(){ int n; int i,j; scanf("%d",&n); memset(str,'\0',sizeof(str)); memset(max,'\0',sizeof(max)); int ans=0; for(i=0;i<n;i++){ scanf("%d",&str[i]); max[i]=1; } for(i=0;i<n;i++){ for(j=0;j<i;j++){ if(str[i]>str[j]&&max[i]<=max[j]) max[i]=max[j]+1; } if(ans<max[i]) ans=max[i]; } printf("%d",ans); return 0;}
0 0
- 动态规划【Longest Ordered Subsequence】
- 动态规划 Longest Ordered Subsequence
- POJ 2533-Longest Ordered Subsequence 动态规划
- POJ 2533 Longest Ordered Subsequence 动态规划
- POJ2533 Longest Ordered Subsequence (动态规划)
- POJ2533:Longest Ordered Subsequence(LIS) 动态规划
- POJ 2533 Longest Ordered Subsequence 动态规划
- acm pku 2533 Longest Ordered Subsequence 动态规划
- POJ 2533 Longest Ordered Subsequence(DP动态规划)
- poj 动态规划DP - 2533 Longest Ordered Subsequence
- POJ 2533 Longest Ordered Subsequence (DP动态规划)
- Pku acm 2533 Longest Ordered Subsequence 动态规划题目解题报告(十二)
- POJ-2533-Longest Ordered Subsequence-最长递增子序列-动态规划
- //POj 2533 Longest Ordered Subsequence(动态规划:最长不减子序列)
- Longest Ordered Subsequence(最长单调递增子序列)poj2533+动态规划
- poj入门水题--动态规划(DP)2533 Longest Ordered Subsequence 1088滑雪
- 【POJ2533】Longest Ordered Subsequence (动态规划&最长上升子序列)
- Longest Ordered Subsequence 【poj-2533】【动态规划-最长上升子序列】
- Xcode快捷键添加注释方法
- 高级替换
- unable to start the virtual devices
- tabhost实现计数标签的简单用法
- MapReduce Shuffle过程分析
- 动态规划 Longest Ordered Subsequence
- 第2周项目2就拿胖子说事
- Spring Cache
- UML图示
- JAVA中堆和栈的区别
- Qt学习之路(29): 绘图设备
- php的学习笔记之面向对象(四)继承补充
- vb.net 获取当前程序的版本(软件自己的版本)
- MyBatis + Spring 整合