BUY LOW, BUY LOWER
| Time Limit: 1000MS | Memory Limit: 30000K | |
| Total Submissions: 10369 | Accepted: 3611 |
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:
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:
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:
"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.
* 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.
* 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
Source
思路：主体部分是最长不下降子序列，但是还要输出有多少种情况。输出情况这部分要注意不重不漏。
1 #include<cstdio> 2 #include<cstdlib> 3 #include<cstring> 4 #include<cmath> 5 #include<algorithm> 6 7 using namespace std; 8 9 int n,mxl,ans,a[6000],f[6000],g[6000]; //f[i]储存以 i为结尾的最长不下降子序列；g[i]储存以 i为结尾的最长不下降子序列的个数 10 11 int main() 12 { 13 scanf("%d",&n); 14 for(int i=1;i<=n;i++) 15 scanf("%d",&a[i]); 16 for(int i=1;i<=n;i++) 17 { 18 bool flg=false; 19 for(int j=i-1;j>=1;j--) 20 { 21 if(a[j]==a[i]){flg=true;break;} //防止重复 (样例中情况 ) 22 if(a[j]>a[i]) 23 { 24 if(f[j]+1>f[i]) 25 { 26 f[i]=f[j]+1; 27 g[i]=g[j]; 28 } 29 else if(f[j]+1==f[i]) 30 g[i]+=g[j]; 31 } 32 } 33 if(!flg)f[i]=max(f[i],1),g[i]=max(g[i],1); 34 mxl=max(mxl,f[i]); 35 } 36 for(int i=1;i<=n;i++) 37 { 38 if(f[i]==mxl)ans+=g[i]; 39 } 40 printf("%d %d",mxl,ans); 41 //system("pause"); 42 return 0; 43 }