POJ 2533 Longest Ordered Subsequence

                                     Longest Ordered Subsequence

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 59959		Accepted: 26861

Description

A numeric sequence of a_i is ordered if a₁ < a₂ < ... < a_N. Let the subsequence of the given numeric sequence ( a₁, a₂, ..., a_N) be any sequence ( a_i1, a_i2, ..., a_iK), where 1 <= i₁ < i₂ < ... < i_K <= 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 

题意概括：输入n个数，求出这n个数的最长的最长不下降子序列

解题思路：朴素动态规划。设置两层循环，外层循环从下标2开始，到最后一个数；内层循环从下标1开始，到i- 1。每次从第i个数的dp开始询问，如果第i个数大于第j个数，就让dp从第j个数的dp加1，与第i个数的dp比较。取最大的那一个。同时在外重循环比较每一次的第i个dp，找出最大的那一个。

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;
}

错误原因：边界数据。当输入为1个数时，应当输出1，因此longst的初值不能置为负数，不然会输出负数。