这么巧妙思路(二)Longest Ordered Subsequence
来源:互联网 发布:json数据转换成数组 编辑:程序博客网 时间:2024/05/27 14:15
C - Longest Ordered Subsequence
Time Limit: 2000 MS Memory Limit: 65536 KB
64-bit integer IO format: %I64d , %I64u Java class name: Main
[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.
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<stdio.h>#include<algorithm>using namespace std;int main(){ int dp[110000]; int a[110000]; int n,i,j; scanf("%d",&n); for(i=0;i<n;i++) scanf("%d",&a[i]); for(i=0;i<n;i++) dp[i]=0; for(i=1;i<n;i++) { for(j=0;j<i;j++) { if(a[i]>a[j]&&dp[i]<dp[j]+1) dp[i]=dp[j]+1; } // printf("%d ",dp[i]); } sort(dp,dp+n); printf("%d\n",dp[n-1]+1);
0 0
- 这么巧妙思路(二)Longest Ordered Subsequence
- 这么巧妙的思路Common Subsequence
- Longest Ordered Subsequence(dp)
- Longest Ordered Subsequence(LIS)
- Longest Ordered Subsequence(dp)
- Longest Ordered Subsequence (dp)
- POJ 2533(Longest Ordered Subsequence)
- poj - 2533 - Longest Ordered Subsequence(LIS)
- Poj 2533 Longest Ordered Subsequence(LIS)
- poj 2533 Longest Ordered Subsequence (LIS)
- POJ 2533-Longest Ordered Subsequence(DP)
- POJ 2533 Longest Ordered Subsequence (LIS)
- poj 2533 Longest Ordered Subsequence(dp)
- POJ 2533 Longest Ordered Subsequence(LIS)
- POJ 2533 Longest Ordered Subsequence (LIS)
- POJ-2533Longest Ordered Subsequence(LIS)
- POJ2533-Longest Ordered Subsequence(LIS)
- Longest Ordered Subsequence(POJ-2533)
- IP TCP UDP 报文格式
- 策略模式
- 中断定时器
- LB 负载均衡的层次结构
- 多重部分和问题
- 这么巧妙思路(二)Longest Ordered Subsequence
- 树莓派(2代)内核定制及调试准备
- Haproxy 配置详解
- 1265: 青年歌手大奖赛_评委会打分
- 深入Java核心 Java内存分配原理精讲
- Fresco(Facebook开源的android项目)图片缓存框架的eclipse整合与使用探索(较详细配置说明)
- sizeof()计算一个类的对象大小和sizeof(string)的问题
- jsp中文乱码问题
- 解决centos 6.6 更换yum 163源报错