poj2553 Longest Ordered Subsequence
来源:互联网 发布:python 矩阵卷积 编辑:程序博客网 时间:2024/04/30 21:54
poj2553
Longest Ordered Subsequence
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 13831 Accepted: 5864
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
思路:本题是求的最长上升子序列,这里用DP,状态转移方程为:
for 0->i to N-1
LIS[i]=1;
LIS[K]=MAX{LIS[i]:0<=i<k&&a[k]>a[i]}+1
代码:
#include<iostream>
using namespace std;
int a[1010];
int LIS[1010];
int main()
{
int N,i,j,max;
scanf("%d",&N);
for(i=0;i<N;i++)
{
scanf("%d",&a[i]);
}
LIS[0]=1;
for(i=0;i<N;i++)
{
LIS[i]=1;
for(j=0;j<=i;j++)
{
if(a[i]>a[j]&&LIS[j]+1>LIS[i])
LIS[i]=LIS[j]+1;
}
}
max=0;
for(i=0;i<N;i++)
{
if(LIS[i]>max)
max=LIS[i];
}
printf("%d/n",max);
return 0;
}
- poj2553 Longest Ordered Subsequence
- 2533--Longest Ordered Subsequence
- Longest Ordered Subsequence
- longest ordered subsequence
- Longest Ordered Subsequence
- Longest Ordered Subsequence
- Longest Ordered Subsequence (P2533)
- POJ2533:Longest Ordered Subsequence
- POJ2533--Longest Ordered Subsequence
- poj2533 Longest Ordered Subsequence
- Longest Ordered Subsequence
- poj2533 Longest Ordered Subsequence
- poj2533 Longest Ordered Subsequence
- POJ2533:Longest Ordered Subsequence
- POJ2533---Longest Ordered Subsequence
- POJ2533:Longest Ordered Subsequence
- ZJU2136 Longest Ordered Subsequence
- POJ2533-Longest Ordered Subsequence
- 速算24点 (c++实现)
- STAX的安装配置
- 你的生日属于什么颜色,它将影响你的性格
- 你的生日属于什么颜色,它将影响你的性格
- mysql导入导出数据库
- poj2553 Longest Ordered Subsequence
- vc平台下的简单PID实现
- ASP.NET 数据绑定 Web 服务器控件概述
- 心痛
- 恭喜蓝月BLOG新开张了
- VC6.0下debug和release版本的浮点运算结果不一致实例分析
- Module入门
- Eclipse下java的3大GUI开发插件及特色
- 转贴:《现代学佛者修证对话》南怀瑾评析