Longest Ordered Subsequence
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 32721 | Accepted: 14303 |
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
7 1 7 3 5 9 4 8
Sample Output
4
Source
Northeastern Europe 2002, Far-Eastern Subregion
dp求lis的最简单题,注意与uva-111的区别是这里的n范围是2~n,而uva-111的n的范围是1~n。只需判断n==1?即可AC
代码如下:
#include <iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=1000+5;
int a[maxn],dp[maxn];
int main()
{
int i,j,maxm,n;
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
dp[1]=1;
maxm=1;
if(n==1) printf("1\n");
else
{
for(i=2;i<=n;i++)
{
dp[i]=1;
for(j=1;j<i;j++)
if(a[j]<a[i])
dp[i]=max(dp[i],dp[j]+1);
maxm=max(maxm,dp[i]);
}
printf("%d\n",maxm);
}
return 0;
}
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=1000+5;
int a[maxn],dp[maxn];
int main()
{
int i,j,maxm,n;
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
dp[1]=1;
maxm=1;
if(n==1) printf("1\n");
else
{
for(i=2;i<=n;i++)
{
dp[i]=1;
for(j=1;j<i;j++)
if(a[j]<a[i])
dp[i]=max(dp[i],dp[j]+1);
maxm=max(maxm,dp[i]);
}
printf("%d\n",maxm);
}
return 0;
}