Longest Ordered Subsequence
Time Limit: 2000MS Memory Limit: 65536K
Total Submissions: 37642 Accepted: 16555
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
7
1 7 3 5 9 4 8
Sample Output
4
求最长上升子序列
解题思路:将数组MAXL【i】存以第i个数为结尾最长上升子序列的长度,则
nMaxLen (1) = 1
nMaxLen (k) = Max { MaxLen (i):1<i < k 且 ai < ak且 k≠1 } + 1
code:
#include <iostream> #include <algorithm> #include <cstdio> #include <string.h> using namespace std; int t,n; int a[1005]; int MAXL[1005]; int main() { scanf("%d",&n); for(int i=1;i<=n;i++) scanf("%d",&a[i]); MAXL[1]=1; for(int i=2;i<=n;i++) { int temp=0; for(int j=1;j<i;j++) { if(a[i]>a[j]) { if(temp<MAXL[j]) temp = MAXL[j]; } } MAXL[i] = temp +1; } int nmx = -1; for(int i = 1;i<=n;i++) { if(nmx<MAXL[i]) nmx = MAXL[i]; } printf("%d\n",nmx); return 0; }
方法二:将最优的解存入数组中,得到的数组长度就是题目的解
code:
#include <iostream>
#include<algorithm>
#include<cstdio>
#include<string.h>
using namespace std;
int a[1005];
int b[1005];
int main()
{
int n,k,j,i;
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
memset(b,0,sizeof(b));
b[1]=a[1];
k=1;
for(i=2;i<=n;i++)
{
if(a[i]>b[k])
b[++k]=a[i];
else
{
j=k;
while(a[i]<=b[j])
j--;
b[j+1]=a[i];
}
}
printf("%d\n",k);
return 0;
}