zoj_2136Longest Ordered Subsequence
2012-12-07 15:50
387 查看
Longest Ordered Subsequence
Time Limit: 2 Seconds Memory Limit: 65536 KB
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, the 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 of this sequence 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 contains the length of sequence N (1 <= N <= 1000). The second line contains the elements of sequence - N integers in the range from 0 to 10000 each, separated
by spaces.
Output
Output must contain a single integer - the length of the longest ordered subsequence of the given sequence.
This problem contains multiple test cases!
The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank
line between input blocks.
The output format consists of N output blocks. There is a blank line between output blocks.
Sample Input
1
7
1 7 3 5 9 4 8
Sample Output
4
最长上升子序列。。。
Time Limit: 2 Seconds Memory Limit: 65536 KB
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, the 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 of this sequence 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 contains the length of sequence N (1 <= N <= 1000). The second line contains the elements of sequence - N integers in the range from 0 to 10000 each, separated
by spaces.
Output
Output must contain a single integer - the length of the longest ordered subsequence of the given sequence.
This problem contains multiple test cases!
The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank
line between input blocks.
The output format consists of N output blocks. There is a blank line between output blocks.
Sample Input
1
7
1 7 3 5 9 4 8
Sample Output
4
最长上升子序列。。。
#include <iostream> #include <cstring> #include <algorithm> using namespace std; const int MAXN = 1005; int main() { freopen("in.txt","r",stdin); int t, n, i, j; int arr[MAXN] = {0}; int dp[MAXN] = {0}; cin >> t; while(t--) { memset(arr,0,sizeof(arr)); memset(dp,0,sizeof(dp)); cin >> n; for(i = 1; i <= n; i++) { cin>>arr[i]; } for(i = 1; i <= n; i++) dp[i] = 1; for(i = 2; i <= n; i++) { for(j = 1; j < i; j++) { if(arr[j] < arr[i] && dp[j] >= dp[i]) dp[i] = dp[j] + 1; } } int ans = -1; for(i = 1; i <= n; i++) ans = max(ans, dp[i]); cout << ans << endl; if(t != 0) cout<<endl; } }
相关文章推荐
- ZOJ Problem Set - 2136 Longest Ordered Subsequence
- ZOJ 1733 Common Subsequence(LCS)
- ZOJ-2091-Mean of Subsequence (反证法的运用!!)
- zoj_2136Longest Ordered Subsequence
- ZOJ - 3123 Subsequence (思路细节)
- zoj 2136.Longest Ordered Subsequence
- ZOJ2136-Longest Ordered Subsequence
- zoj 1733 Common Subsequence
- ZOJ 2136(Longest Ordered Subsequence)
- ZOJ 2136 Longest Ordered Subsequence 【DP】
- ZOJ-2091 Mean of Subsequence
- ZOJ 2136 Longest Ordered Subsequence
- ZOJ-2091-Mean of Subsequence
- zoj 2091 Mean of Subsequence(奇怪的贪心)
- ZOJ 1733 Common Subsequence【DP】
- POJ 1458 Common Subsequence (zoj 1733 ) LCS
- POJ 1458 Common Subsequence (zoj 1733 ) LCS
- ZOJ 2432 Greatest Common Increasing Subsequence——dp
- poj 2533 && zoj 2136 Longest Ordered Subsequence --- LIS模板
- ZOJ - 1733 Common Subsequence