POJ 1952
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 7748 | Accepted: 2678 |
Description
"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
* Lines 2..etc: A series of N space-separated integers, ten per line except the final line which might have fewer integers.
Output
* 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[];
int dp[];
int num[];
int n;
int ans, time;
while(scanf("%d", &n) != EOF)
{
ans = ;
time = ;
for (int i = ; i < n; i++)
{
cin>>num[i];
dp[i] = ;
times[i] = ;
}
for (int i = ; i < n; i++)
{
for (int j = i - ; j >= ; j--)
{
if (num[j] > num[i])
{
if (dp[j] + > dp[i])
{
dp[i] = dp[j] + ;
times[i] = times[j];
}
else
{
if (dp[j] + == dp[i])
{
times[i] += times[j];
}
}
}
else
{
if (num[i] == num[j])
{
if (dp[i] == )
{
times[i] = ;
}
break;
}
}
}
}
for (int i = ; i < n; i++)
{
ans = max(ans, dp[i]);
}
for (int i = ; i < n; i++)
{
if (ans == dp[i])
{
time += times[i];
}
}
printf("%d %d\n", ans, time);
}
return ;
}
最新文章
- backbone库学习-Router
- Linux下防火墙开启相关端口及查看已开启端口
- jquery ajax rest invoke
- HBase在单Column和多Column情况下批量Put的性能对比分析
- php读取xml文件内容,并循环写入mysql数据库
- 6款基于SVG的HTML5CSS3应用和动画
- Oracle 6 - 锁和闩 - 锁类型
- Objective-C 【完整OC项目-购票系统-系统分析-代码实现】
- SDUTRescue The Princess(数学问题)
- ubuntu安装hadoop 若干问题的解决
- JTable
- poj_1743_Musical Theme(后缀数组)
- SQLite 之 C#版 System.Data.SQLite 使用
- pandas教程1:pandas数据结构入门
- H5+Ajax+WebApi实现文件下载(进度条,多文件)
- wpf之WrapPanel与StackPanel
- 宽度优先搜索BFS(Breadth-First-Search)
- django_models后台管理myarya
- 类的数据成员加前缀 m_(表示 member)
- Python爬虫教程-04-response简介