poj 1952 BUY LOW, BUY LOWER-DP 解法

BUY LOW, BUY LOWER

Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 6705 Accepted: 2306

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 12Price 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 10Price 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

1268 69 54 64 68 64 70 67 78 6298 87

Sample Output

4 2
#include<iostream>using namespace std;int main(){int n,i,j,max1=0,max2=0,dp[5001],a[5001],b[5001];//b[i]是种数cin>>n;for(i=1;i<=n;i++){cin>>a[i];b[i]=1;dp[i]=1;}for(i=2;i<=n;i++)for(j=i-1;j>0;j--)//从后面往前面检索{if(a[j]>a[i]&&dp[i]<dp[j]+1){dp[i]=dp[j]+1;b[i]=b[j];}else if(a[j]>a[i]&&dp[i]==dp[j]+1) b[i]+=b[j];//如果第j种情况数+1与第i种情况数相等，则这种情况总数应为这两种情况数之和if(a[i]==a[j]){if(dp[i]==1)//如果a[i]与a[j]挨着就排除一样的情况b[i]=0;break;//跳出循环排除重复}}for(i=1;i<=n;i++)if(dp[i]>max1)max1=dp[i];for(i=1;i<=n;i++)if(dp[i]==max1)max2+=b[i];//把符合情况的数目加起来cout<<max1<<' '<<max2<<endl;return 0;}