Longest Ordered Subsequence
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 59959 | Accepted: 26861 |
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
题意概括:求n个数的最长不下降子序列
解题思路:朴素动态规划
AC代码:
#include<stdio.h>
#include<algorithm>
#define N 100005
using namespace std;
int main(void)
{
int n, i, j, a[N], dp[N], longst = 1;
scanf("%d", &n);
for(i = 1; i <= n; i ++)
{
scanf("%d", &a[i]);
dp[i] = 1;
}
for(i = 2; i <= n; i ++)
{
for(j = 1; j <= i - 1; j ++)
{
if(a[i] > a[j])
{
dp[i] = max(dp[j] + 1, dp[i]);
}
}
longst = max(dp[i], longst);
}
printf("%d\n", longst);
return 0;
}
错误原因:注意边界数据,比如当n为1时的情况。