zoukankan      html  css  js  c++  java
  • POJ3903:Stock Exchange(LIS)

    Description

    The world financial crisis is quite a subject. Some people are more relaxed while others are quite anxious. John is one of them. He is very concerned about the evolution of the stock exchange. He follows stock prices every day looking for rising trends. Given a sequence of numbers p1, p2,...,pn representing stock prices, a rising trend is a subsequence pi1 < pi2 < ... < pik, with i1 < i2 < ... < ik. John’s problem is to find very quickly the longest rising trend.

    Input

    Each data set in the file stands for a particular set of stock prices. A data set starts with the length L (L ≤ 100000) of the sequence of numbers, followed by the numbers (a number fits a long integer). 
    White spaces can occur freely in the input. The input data are correct and terminate with an end of file.

    Output

    The program prints the length of the longest rising trend. 
    For each set of data the program prints the result to the standard output from the beginning of a line.

    Sample Input

    6 
    5 2 1 4 5 3 
    3  
    1 1 1 
    4 
    4 3 2 1

    Sample Output

    3 
    1 
    1

    Hint

    There are three data sets. In the first case, the length L of the sequence is 6. The sequence is 5, 2, 1, 4, 5, 3. The result for the data set is the length of the longest rising trend: 3.
     
    题意:
    求最长子序列问题:
     
    #include<cstdio>
    #include<algorithm>
    #include<iostream>
    using namespace std;
    const int INF=100050;
    int a[100047],dp[100047];
    int main(){
        int t,i;
        while(scanf("%d",&t)!=EOF){
            for(i = 0; i <= t; i++)dp[i]=INF;
    
            for(i = 0; i < t; i++)scanf("%d",&a[i]);
    
            for(i = 0; i < t; i++){
                *lower_bound(dp,dp+t,a[i])=a[i];
            }
            printf("%d
    ",lower_bound(dp,dp+t,INF)-dp);
        }
        return 0;
    }
    View Code
  • 相关阅读:
    Count Complete Tree Nodes***
    Kth Smallest Element in a BST
    Lowest Common Ancestor of a Binary Search Tree
    VPC实验案例
    BGP实验 (IBGP,EBGP) neighbor
    BGP基础实验 Cyrus
    H3c AC模式切换
    语音实验8 硬件电话通过DHCP方式连接到CME
    语音实验7 2台CME,3台软件电话
    语音实验6 1台CME,2台软件电话
  • 原文地址:https://www.cnblogs.com/demodemo/p/4732525.html
Copyright © 2011-2022 走看看