POJ 2533 Longest Ordered Subsequence
2014-10-20 10:21
183 查看
Longest Ordered Subsequence
Time Limit: 2000msMemory Limit: 65536KB
This problem will be judged on PKU. Original ID: 2533
64-bit integer IO format: %lld Java class name: Main
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 <= 1000Output
Output file must contain a single integer - the length of the longest ordered subsequence of the given sequence.Sample Input
7 1 7 3 5 9 4 8
Sample Output
4
Source
Northeastern Europe 2002, Far-Eastern Subregion解题:LIS
#include <iostream> #include <cstdio> #include <cstring> #include <cmath> #include <algorithm> #include <climits> #include <vector> #include <queue> #include <cstdlib> #include <string> #include <set> #include <stack> #define LL long long #define pii pair<int,int> #define INF 0x3f3f3f3f using namespace std; const int maxn = 1010; int dp[maxn],d[maxn],n; int main() { while(~scanf("%d",&n)){ for(int i = 0; i < n; ++i){ scanf("%d",d+i); dp[i] = INF; } dp = INF; for(int i = 0; i < n; ++i){ int *p = lower_bound(dp,dp+n+1,d[i]); *p = d[i]; } printf("%d\n",lower_bound(dp,dp+n+1,INF)-dp); } return 0; }
View Code
相关文章推荐
- POJ 2533 Longest Ordered Subsequence——LIS
- 【DP|LIS】POJ-2533 Longest Ordered Subsequence(O(n^2)、O(nlogn))
- POJ 2533 Longest Ordered Subsequence
- poj-2533-Longest Ordered Subsequence-最长上升子序列
- POJ 2533 Longest Ordered Subsequence(最长上升子序列模版)
- POJ 2533 Longest Ordered Subsequence(基础DP)
- POJ 1631 Bridging signals & 2533 Longest Ordered Subsequence
- 【最大上升子序列+经典题】北大 poj 2533 Longest Ordered Subsequence
- poj-2533-Longest Ordered Subsequence
- POJ 2533 Longest Ordered Subsequence(最长上升子序列O(n*n)解法)
- poj 2533 Longest Ordered Subsequence (最长子序列)
- poj 2533/3903 Longest Ordered Subsequence(最长升序子串)
- POJ:2533 Longest Ordered Subsequence(LIS-n*logn解法)
- poj 2533 Longest Ordered Subsequence(最长上升子序列)
- poj 2533:Longest Ordered Subsequence 求最长递增序列长度
- poj 2533 Longest Ordered Subsequence
- POJ2533——Longest Ordered Subsequence
- POJ-2533(LIS) Longest Ordered Subsequence
- 【dp】POJ 2533 Longest Ordered Subsequence
- Longest Ordered Subsequence(POJ-2533)