poj2533
来源:互联网 发布:android c语言编译器 编辑:程序博客网 时间:2024/04/30 22:44
Longest Ordered Subsequence
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 6756 | Accepted: 2667 |
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<iostream>
#include<cstdio>
using namespace std;
int sum[1010],a[1010];
int dongtai(int i)
{
int t,t1,t2=0;
if(sum[i]!=0) return sum[i];
for(t=i-1;t>=0;t--)
if(a[i]>a[t])
{
t1=dongtai(t)+1;
if(t1>t2) t2=t1;
}
sum[i]=t2;
if(sum[i]==0) sum[i]=1;
return sum[i];
}
int main()
{
int i,n;
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
memset(sum,0,sizeof(sum));
int temp,max=0;
for(i=0;i<n;i++)
{
temp=dongtai(i);
if(temp>max)
max=temp;
}
cout<<max<<endl;
return 0;
}
- poj2533
- POJ2533
- poj2533
- poj2533
- poj2533
- POJ2533
- poj2533
- POJ2533
- poj2533
- poj2533--LIS
- poj2533 LongestOrderedSubsequence
- poj2533(LIS)
- poj2533 LIS
- POJ2533(LIS)
- poj2533解题报告
- poj2533解题报告
- poj2533 简单DP LIS
- poj2533(最长递增序列)
- 用vc写DLL - -
- VC编写DLL几种方法的简介
- DNS漏洞攻击代码已经公布
- 如何对PHP程序中的常见漏洞进行攻击
- 一个自考生的真实经历
- poj2533
- 未来两年目标,开支与缺口
- 文本的读和写
- 计算几何常用算法
- 软件测试之单元测试的内容与步骤
- Cisco IOS 12.3(18) FTP Server Remote Exploit (attached to gdb)
- DLL初学者指南(非MFC)
- 地图不能展示
- XML配置的文件的读写