poj 1952 BUY LOW, BUY LOWER
来源:互联网 发布:青云云计算 编辑:程序博客网 时间:2024/04/30 16:37
BUY LOW, BUY LOWER
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 10545 Accepted: 3694
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 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.
* 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
1268 69 54 64 68 64 70 67 78 6298 87
Sample Output
4 2
思路:求最长递减子序列以及个数即可。
代码:#include <iostream>#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;int a[5555];int dp[5555],ans[5555];int main(){ int N; while(scanf("%d",&N)!=EOF) { int i,j; for(i=1;i<=N;i++) { scanf("%d",&a[i]); } for(i=1;i<=N;i++) { dp[i]=1; ans[i]=0; } for(i=1;i<=N;i++) { for(j=1;j<i;j++) { if(a[i]<a[j]) { dp[i]=max(dp[i],dp[j]+1); } } } for(i=1;i<=N;i++) { if(dp[i]==1)ans[i]=1; } for(i=2;i<=N;i++) { for(j=i-1;j>0;j--) { if(a[j]>a[i]) { if(dp[i]==dp[j]+1) { ans[i]+=ans[j]; } } if(a[i]==a[j]) { if(dp[i]==1)ans[i]=0; break; } } } int maxn=0; for(i=1;i<=N;i++) { maxn=max(dp[i],maxn); } int k=0; for(i=1;i<=N;i++) { if(dp[i]==maxn) { k+=ans[i]; } } cout<<maxn<<' '<<k<<endl; } return 0;}
阅读全文
0 0
- POJ 1952 BUY LOW, BUY LOWER(DP)
- POJ 1952 BUY LOW, BUY LOWER
- poj 1952 BUY LOW, BUY LOWER
- POJ 1952 buy low,buy lower
- poj 1952 buy low buy lower(DP)
- poj 1952 Buy low, buy lower
- POJ 1952 BUY LOW, BUY LOWER
- POJ 1952 BUY LOW, BUY LOWER
- POJ 1952 BUY LOW, BUY LOWER
- poj 1952 BUY LOW, BUY LOWER dp
- POJ 1952 BUY LOW, BUY LOWER
- poj 1952buy low, buy lower
- POJ 1952 BUY LOW, BUY LOWER DP
- POJ 1952 Buy Low,Buy Lower
- POJ 1952 BUY LOW, BUY LOWER
- POJ 1952BUY LOW, BUY LOWER
- POJ 1952 BUY LOW, BUY LOWER
- POJ 1952 C++:BUY LOW, BUY LOWER
- 右键 XCODE就能打开application loader 选择ARCHIVE下的IPA文件就能上传 不用再XCODE里上传傻等
- Python学习笔记1:python简介
- 深入理解http get post url request和response
- SQLite
- [thinkPHP5项目实战_25]前台文章列表展示
- poj 1952 BUY LOW, BUY LOWER
- 【Excel-2010】日期函数
- 最全的freemarker教程
- 6.9求e的值
- 在Linux上安装JDK、Tomcat、MySQL软件
- C++面试出现频率最高的面试题
- 跨域的几种解决方案
- SSH-CRUD-查询
- Mysql进程未完全关闭,导致重启失败