最长上升子序列
来源:互联网 发布:php 编译扩展dll 编辑:程序博客网 时间:2024/06/06 02:46
Problem 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
71 7 3 5 9 4 8
Sample Output
4
#include<iostream>#include<cstdio>#include<algorithm>using namespace std;struct input{int num,b;}a[1010];bool cmp(input x,input y){return x.b>y.b;}int main(){//freopen("a.txt","r",stdin);int n,i,first=1,max;while(scanf("%d",&n)!=EOF){for(i=1;i<=n;i++) {max=0; scanf("%d",&a[i].num); a[i].b=1; if(first) first=0; else { for(int j=1;j<i;j++) if(a[i].num>a[j].num&&max<a[j].b) max=a[j].b; a[i].b+=max; // 找出到此位置的最长上升子序列 } } sort(a+1,a+i,cmp); printf("%d\n",a[1].b);}return 0;}
0 0
- 最长上升子序列
- 最长上升子序列
- 最长上升子序列
- 最长上升子序列
- 最长上升子序列
- 最长上升子序列
- 最长上升子序列
- 最长上升子序列
- 最长上升子序列
- 最长上升子序列
- 最长上升子序列
- 最长上升子序列
- 最长上升子序列
- 最长上升子序列
- 最长上升子序列
- 最长上升子序列
- 最长上升子序列
- 最长上升子序列
- Android 文件打开方式
- PIE兼容IE的圆角实现
- 自定义类处理消息循环HWND_MESSAGE
- Hibernate实体映射
- strlen() sizeof() lenth()函数的返回值问题
- 最长上升子序列
- Linux之网络配置(不断更新中)
- Java在linux环境下创建文件夹的方法
- uva-10905-Childden’s game
- Delphi清理释放本程序内存的代码
- android文件打开及Intent及使用
- 推荐8个超棒的学习 jQuery 的网站
- oc笔记-深浅复制
- uva-10763-Foreign Exchange