POJ 1952 LITTLE SHOP OF FLOWERS(DP动归,最长递减子序列)
来源:互联网 发布:固镇行知中学在哪? 编辑:程序博客网 时间:2024/06/05 05:28
题目地址:http://poj.org/problem?id=1952
BUY LOW, BUY LOWER
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
Source
USACO 2002 February
此题是简单的DP题,同时也是非常经典的DP题。如题,此题的主要难度(对于我们这些新手)在于统计最长递减
子序列的个数。
此题是简单的DP题,同时也是非常经典的DP题。如题,此题的主要难度(对于我们这些新手)在于统计最长递减
子序列的个数。
#include<stdio.h>#include<algorithm>#include<stdlib.h>#include<math.h>#include<string.h>#include<queue>#define ll long long;#define inf 0x3f3f3f3f#define ins 0xc0using namespace std;int dp[5005], cnt[5005], N, maxlen, mlnum;int dayp[5005];int main(){while (scanf("%d", &N) != EOF){for (int i = 1; i <= N; i++) scanf("%d", &dayp[i]);for (int i = 0; i <= N; i++){dp[i] = 0;cnt[i] = 0;}dayp[0] = inf;cnt[0] = 1;dp[0] = 0;maxlen = 1;mlnum = 0;for (int i = 1; i <= N; i++){for (int j = 0; j < i; j++){if (dayp[i] < dayp[j]) dp[i] = max(dp[i], dp[j] + 1); //这是状态转移方程 else if (dayp[i] == dayp[j]) cnt[j] = 0; //解决相同子序列问题}for (int j = 0; j < i; j++){if (dp[i] == (dp[j] + 1) && dayp[i] < dayp[j]){cnt[i] += cnt[j]; //cnt[i]表示到第i个时包含dayp[i]元素最长不同子序列个数}}maxlen = max(maxlen, dp[i]);}for (int i = 1; i <= N; i++) {if (dp[i] == maxlen) mlnum += cnt[i];}printf("%d %d\n", maxlen, mlnum);}return 0;}感谢各位大神的阅读~
0 0
- POJ 1952 LITTLE SHOP OF FLOWERS(DP动归,最长递减子序列)
- poj 1157 little shop of flowers(动归)
- POJ 1157 LITTLE SHOP OF FLOWERS (DP)
- POJ 1157 LITTLE SHOP OF FLOWERS ( DP )
- POJ 1157-LITTLE SHOP OF FLOWERS(DP)
- poj 1157 LITTLE SHOP OF FLOWERS dp
- poj 1157 LITTLE SHOP OF FLOWERS(DP)
- 【DP】POJ-1157 LITTLE SHOP OF FLOWERS
- POJ 1157 LITTLE SHOP OF FLOWERS(DP)
- poj 1157 LITTLE SHOP OF FLOWERS(DP)
- poj - 1157 - LITTLE SHOP OF FLOWERS(dp)
- POJ 1157 LITTLE SHOP OF FLOWERS(DP)
- POJ 题目1157 LITTLE SHOP OF FLOWERS(DP)
- LITTLE SHOP OF FLOWERS(dp)
- SGU104 Little shop of flowers (DP)
- poj 1157 LITTLE SHOP OF FLOWERS DP 背包问题变形
- poj 1157 LITTLE SHOP OF FLOWERS 【简单DP】
- POJ 1157 LITTLE SHOP OF FLOWERS 水DP
- 平面向量加法(10)
- UITableView常用函数
- 查找整数
- UVA 11624 Fire!(kuangbin带你飞 专题一:简单搜索)
- 多重背包问题
- POJ 1952 LITTLE SHOP OF FLOWERS(DP动归,最长递减子序列)
- android屏幕分辨率及自动匹配相关
- 获取沙盒目录
- Android动画(图片闪烁、左右摇摆、上下晃动等效果)
- 离线检测 window.navigator.onLine
- Android Fragment的使用
- snort openappid
- R语言学习备忘录(三):数组、矩阵、列表和数据框、因子的应用
- 大端模式&小端模式