zoukankan      html  css  js  c++  java
  • POJ 1952

    BUY LOW, BUY LOWER
    Time Limit: 1000MS   Memory Limit: 30000K
    Total Submissions: 7748   Accepted: 2678

    Description

    The advice to "buy low" is half the formula to success in the bovine stock market.To be considered a great investor you must also follow this problems' advice: 
                        "Buy low; buy lower"

    Each time you buy a stock, you must purchase it at a lower price than the previous time you bought it. The more times you buy at a lower price than before, the better! Your goal is to see how many times you can continue purchasing at ever lower prices. 

    You will be given the daily selling prices of a stock (positive 16-bit integers) over a period of time. You can choose to buy stock on any of the days. Each time you choose to buy, the price must be strictly lower than the previous time you bought stock. Write a program which identifies which days you should buy stock in order to maximize the number of times you buy. 

    Here is a list of stock prices: 
     Day   1  2  3  4  5  6  7  8  9 10 11 12
    
    Price 68 69 54 64 68 64 70 67 78 62 98 87


    The best investor (by this problem, anyway) can buy at most four times if each purchase is lower then the previous purchase. One four day sequence (there might be others) of acceptable buys is: 
    Day    2  5  6 10
    
    Price 69 68 64 62

    Input

    * Line 1: N (1 <= N <= 5000), the number of days for which stock prices are given 

    * Lines 2..etc: A series of N space-separated integers, ten per line except the final line which might have fewer integers. 

    Output

    Two integers on a single line: 
    * The length of the longest sequence of decreasing prices 
    * The number of sequences that have this length (guaranteed to fit in 31 bits) 

    In counting the number of solutions, two potential solutions are considered the same (and would only count as one solution) if they repeat the same string of decreasing prices, that is, if they "look the same" when the successive prices are compared. Thus, two different sequence of "buy" days could produce the same string of decreasing prices and be counted as only a single solution. 

    Sample Input

    12
    68 69 54 64 68 64 70 67 78 62
    98 87
    

    Sample Output

    4 2
    题目大意:求最长下降子序列,并求出子序列的种数。
    #include <stdio.h>
    #include <iostream>
    #include <string.h>
    using namespace std;
    
    int main()
    {
        int times[5005];
        int dp[5005];
        int num[5005];
        int n;
        int ans, time;
        while(scanf("%d", &n) != EOF)
        {
            ans = 0;
            time = 0;
            for (int i = 0; i < n; i++)
            {
                cin>>num[i];
                dp[i] = 1;
                times[i] = 1;
            }
            for (int i = 1; i < n; i++)
            {
                for (int j = i - 1; j >= 0; j--)
                {
                    if (num[j] > num[i])
                    {
                        if (dp[j] + 1 > dp[i])
                        {
                            dp[i] = dp[j] + 1;
                            times[i] = times[j];
                        }
                        else
                        {
                            if (dp[j] + 1 == dp[i])
                            {
                                times[i] += times[j];
                            }
                        }
                    }
                    else
                    {
                        if (num[i] == num[j])
                        {
                            if (dp[i] == 1)
                            {
                                times[i] = 0;
                            }
                            break;
                        }
                    }
                }
            }
            for (int i = 0; i < n; i++)
            {
                ans = max(ans, dp[i]);
            }
            for (int i = 0; i < n; i++)
            {
                if (ans == dp[i])
                {
                    time += times[i];
                }
            }
            printf("%d %d
    ", ans, time);
        }
        return 0;
    }
  • 相关阅读:
    003_当表中字段不能为空,但却没有赋值时?
    019_SSM——mybatis的#{id}可以根据是对象参数调用setId()的原码?
    002_com.wkcto自动添加错误
    018_SSM——Spring框架的byName与ByType实现自动注入的原码是什么呢?
    as3 文档类引用
    as3 连接mysql
    as2 针对加载进来的swf操作
    as3 arguments.callee与... (rest)
    as3 string split方法一些注意
    as3 Function 中的call与apply方法
  • 原文地址:https://www.cnblogs.com/lzmfywz/p/3226455.html
Copyright © 2011-2022 走看看