【POJ2533】Longest Ordered Subsequence (动态规划&最长上升子序列)
来源:互联网 发布:淘宝头像 编辑:程序博客网 时间:2024/05/16 12:16
这里是题目
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 (动态规划&最长上升子序列)
- poj2533--Longest Ordered Subsequence(dp:最长上升子序列)
- poj2533 Longest Ordered Subsequence(最长上升子序列)
- poj2533 Longest Ordered Subsequence(最长上升子序列个数)
- Longest Ordered Subsequence(最长单调递增子序列)poj2533+动态规划
- POJ2533 Longest Ordered Subsequence (最长上升子序列)
- 【POJ2533】Longest Ordered Subsequence(LIS-最长上升子序列/DP)
- poj2533-Longest Ordered Subsequence(最长上升子序列)
- POJ2533 Longest Ordered Subsequence【最长上升子序列+DP】
- POJ2533 Longest Ordered Subsequence(最长递增子序列)
- Longest Ordered Subsequence 【poj-2533】【动态规划-最长上升子序列】
- Longest Ordered Subsequence 最长上升子序列
- Longest Ordered Subsequence (最长上升子序列)
- poj 2533 Longest Ordered Subsequence(最长上升子序列)
- Longest Ordered Subsequence(最长上升子序列)
- POJ 2533 Longest Ordered Subsequence(最长上升子序列)
- POJ 2533 Longest Ordered Subsequence(最长上升子序列)
- poj_2533 Longest Ordered Subsequence(最长上升子序列)
- 密码学----基础概念(二)
- 单调队列
- html各种分割线
- 单调栈/LIS的log n做法
- 深入学习js之浅谈作用域(RHS和LHS)
- 【POJ2533】Longest Ordered Subsequence (动态规划&最长上升子序列)
- iOS应用兼容测试策略学习笔记
- 设计模式讲解与代码实践(十七)——迭代器
- spring入门之IOC容器
- classList
- 扩展文件系统(Ext)
- JavaScript基本语法++、语句Statement
- 第三天:目的
- HTML笔记