poj 2533 Longest Ordered Subsequence
来源:互联网 发布:java 当前时间戳 编辑:程序博客网 时间:2024/06/16 07:15
Longest Ordered Subsequence
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 35239 Accepted: 15471
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[n],dp[i]表示到第i个数的最长上升子序列。
代码如下:
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <set>#include <queue>using namespace std;#define maxn 1005#define inf 0x7ffffffint arr[maxn];int dp[maxn];int n;int main(){ scanf("%d",&n); for(int i = 0;i < n; i++){ scanf("%d",&arr[i]); } for(int i = 0; i <= n; i++){ dp[i] = 1; } for(int i = 0; i < n; i++){ for(int j = i ;j >= 0;j--){ if(arr[i] > arr[j]){ dp[i] = max(dp[i],dp[j]+1); } } } for(int i = 0; i < n; i++){ dp[n] = max(dp[n],dp[i]); } printf("%d\n",dp[n]); return 0;}
0 0
- POJ 2533 Longest Ordered Subsequence
- poj 2533Longest Ordered Subsequence
- poj 2533 Longest Ordered Subsequence
- Poj 2533 Longest Ordered Subsequence
- poj 2533 Longest Ordered Subsequence
- poj 2533 Longest Ordered Subsequence
- POJ 2533 Longest Ordered Subsequence
- POJ 2533 Longest Ordered Subsequence
- POJ 2533 Longest Ordered Subsequence
- POJ 2533 Longest Ordered Subsequence
- poj 2533 Longest Ordered Subsequence
- POJ 2533 Longest Ordered Subsequence
- POJ 2533 Longest Ordered Subsequence
- poj 2533 Longest Ordered Subsequence
- POJ 2533 Longest Ordered Subsequence
- POJ 2533 Longest Ordered Subsequence
- POJ 2533 : Longest Ordered Subsequence
- POJ 2533 Longest Ordered Subsequence
- va_start/va_arg/va_end--------可变参函数
- ClassNotFound问题即maven dependencies没有加入Deployment Assembly的解决
- ARM的触摸屏启动
- VS 2008 解决方案的目录结构设置和管理 [整理]
- UVa524 - Prime Ring Problem 枚举排列模板题
- poj 2533 Longest Ordered Subsequence
- 【BZOJ】【P3239】【Discrete Logging】【题解】【BSGS】
- Leetcode_96_Unique Binary Search Trees
- [转]iOS http文件下载断点续传
- Apple Watch Kit(2)- Actionable Notifications
- Bootstrap分页插件--Bootstrap Paginator
- ARM编译
- 过滤器Filter使用
- adb常用命令学习(二)--安装本地应用