poj 2533 最长上升子序列

最新推荐文章于 2020-03-19 15:08:24 发布

zhang_xiang_16

最新推荐文章于 2020-03-19 15:08:24 发布

阅读量257

点赞数

分类专栏： mooc 动态规划（dp）

本文链接：https://blog.csdn.net/doomape/article/details/79329488

版权

mooc 同时被 2 个专栏收录

13 篇文章 0 订阅

订阅专栏

动态规划（dp）

4 篇文章 0 订阅

订阅专栏

Longest Ordered Subsequence

        Time Limit: 2000MS      Memory Limit: 65536K
            Total Submissions: 58233        Accepted: 26082

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

Source

Northeastern Europe 2002, Far-Eastern Subregion

解析：
这是一个动态规划的题目，解决的关键就在于找出一个无后效性的状态值。把每个数作为最长子序列的”终点“，这个终点包含在最长子序列当中。当把下一个数作为终点的时候，只要考虑前面的每个数作为最长子序列的值就好了。

#include <iostream>
#include <algorithm>
using namespace std;

int n;
int src[1000];
int maxLen[1000];
void f(int k){
    int max = 1;
    for(int i = 0;i < k; ++i){
        if(src[i] < src[k] ){
            if(maxLen[i] + 1 > max){
                max = maxLen[i] + 1;
            }
        }
    }

    maxLen[k] = max;
}
int main(){
    cin >> n;
    for(int i = 0;i < n; ++i){
        cin >> src[i] ;
        f(i);
    }

    cout << * max_element(maxLen,maxLen+n )<< endl;
    return 0;
}