http://poj.org/submit?problem_id=2533
Longest Ordered Subsequence
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 23801 | Accepted: 10301 |
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
题意:求最长上升子序列。和poj1836一样,比1836还简单直接把1836的代码来改的
//最长单调子序列,看清题意,从左边求上升
//最长单调子序列,看清题意,从左边求上升
//思路:用了IS分别从前往后,得到啊a[]最后取a[i]的最大值;
#include<iostream>
#include<cstring>
using namespace std;
#define MAXN 100100
//double s[MAXN];
int a[MAXN],b[MAXN];
int s[MAXN];
int n;
int main()
{
while(scanf("%d",&n)!=EOF)
{
int i,j;
for(i=1;i<=n;i++)
scanf("%d",&s[i]);
a[1]=1;
for(i=2;i<=n;i++)//从头开始计算最长的递增序列
{
a[i]=1;
for(j=1;j<i;j++)
{
if(s[i]>s[j]&&a[j]>=a[i])
a[i]=a[j]+1;
}
}
//
b[n]=1;
//
for(i=n-1;i>=1;i--)//从尾部计算最长的递增序列
//
{
//
b[i]=1;
//
for(j=n;j>i;j--)
//
{
//
if(s[i]>s[j]&&b[j]>=b[i])
//
b[i]=b[j]+1;
//
}
//
}
int max=-100000;//初始化max
for(i=1;i<=n;i++)
{
//for(j=i+1;j<=n;j++)//这边还要隐藏wa了3次
//{
if(a[i]>max)
max=a[i];
//}
}
printf("%d\n",max);
}
return 0;
}
#include<iostream>
#include<cstring>
using namespace std;
#define MAXN 100100
//double s[MAXN];
int a[MAXN],b[MAXN];
int s[MAXN];
int n;
int main()
{
}