Longest Ordered Subsequence 最长上升子序列
来源:互联网 发布:php字符串函数 编辑:程序博客网 时间:2024/05/18 02:16
Longest Ordered Subsequence
Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u
Submit
Status
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
Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u
Submit
Status
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<string.h>#include<algorithm>using namespace std;int a[1010];int dp[1010];int main(){ int n; // freopen("in.txt","r",stdin); while(~scanf("%d",&n)) { for(int i=0;i<n;i++) scanf("%d",&a[i]); dp[0]=1; int ans=1; for(int i=1;i<n;i++) { dp[i]=1; for(int j=0;j<i;j++) { if(a[i]>a[j]) dp[i]=max(dp[i],dp[j]+1); else if(a[i]==a[j]) dp[i]=max(dp[i],dp[j]); } ans=max(ans,dp[i]); } printf("%d\n",ans); }}
- Longest Ordered Subsequence 最长上升子序列
- Longest Ordered Subsequence (最长上升子序列)
- ZJU2136 Longest Ordered Subsequence - 最长上升子序列nlogn
- TOJ 1765 Longest Ordered Subsequence 最长上升子序列 DP
- zju2136最长上升子序列Longest Ordered Subsequence
- poj-2533-Longest Ordered Subsequence-最长上升子序列
- poj 2533 Longest Ordered Subsequence(LIS(最长上升子序列))
- POJ 2533 Longest Ordered Subsequence 最长上升子序列
- poj 2533 Longest Ordered Subsequence(最长上升子序列)
- Longest Ordered Subsequence(最长上升子序列)
- poj 2533 Longest Ordered Subsequence(最长上升子序列)
- Longest Ordered Subsequence - POJ 2533 最长上升子序列
- poj 2533 Longest Ordered Subsequence(最长上升子序列)
- poj2533--Longest Ordered Subsequence(dp:最长上升子序列)
- POJ 2533 Longest Ordered Subsequence(LIS:最长上升子序列)
- POJ 2533-Longest Ordered Subsequence(dp_最长上升子序列)
- POJ 2533 Longest Ordered Subsequence(最长上升子序列)
- poj-2533 Longest Ordered Subsequence 【最长上升子序列】
- Reverse Integer--整数的反转
- 注重用户互动 Path 2.5评测
- 字符全排列产生器
- 脑找不到关机键了
- HDU 1753 大明A+B && 大实数
- Longest Ordered Subsequence 最长上升子序列
- 设计模式C++实现(1)——工厂模式
- VC6.0如何编译生成Release或Debug版本?
- 从头学Android之机器人的意图之Intent的Action
- Documentation_namespaces_compatibility-list
- hibernate一对一单向外键关联之XML
- C# 引用类型-数组类型
- mysql定时任务
- C# 引用类型-接口类型