zoukankan      html  css  js  c++  java
  • Longest Ordered Subsequence

    Language:
    Longest Ordered Subsequence
    Time Limit: 2000MS   Memory Limit: 65536K
    Total Submissions: 33812   Accepted: 14809

    Description

    A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1a2, ..., aN) be any sequence (ai1ai2, ..., 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

    4
    

    Source

    Northeastern Europe 2002, Far-Eastern Subregion
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     1 #include<iostream>
     2 #include<stdio.h>
     3 #include<algorithm>
     4 
     5 using namespace std;
     6  
     7 int main()
     8 {
     9        freopen("ACM.txt","r",stdin);
    10        int n,i,j,maxsum=0,a[1000],dp[1000];
    11        while(cin>>n) 
    12        {       
    13                for(i=0;i<n;i++) cin>>a[i];
    14                dp[0]=1; 
    15                for(i=1;i<n;i++) 
    16                {
    17                       dp[i]=1; 
    18                       for(j=0;j<i;j++) 
    19                       if(a[i]>a[j]) dp[i]=max(dp[i],dp[j]+1); 
    20                }        
    21                for(i=0;i<n;i++) maxsum=max(maxsum,dp[i]);
    22                cout<<maxsum<<endl;
    23                maxsum=0;
    24        }           
    25        return 0;
    26 }
    View Code
  • 相关阅读:
    博客样式备份
    2018年终总结
    技术博客的太监
    LeetCode 日常填坑
    互联网之父
    TotoiseSVN的使用方法
    常用CMD命令
    量化策略
    浏览器加载js的阻塞与非阻塞
    Vue核心之数据劫持
  • 原文地址:https://www.cnblogs.com/M-D-LUFFI/p/3998252.html
Copyright © 2011-2022 走看看