USACO: Buy Low, Buy Lower

Buy Low, Buy Lower

The advice to "buy low" is half the formula to success in the stock market. But to be considered a great investor you must also follow this problems' advice:

"Buy low, buy lower"

That is, each time you buy a stock, you must purchase more 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 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 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.

By way of example, suppose on successive days stock is selling like this:

 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

In the example above, the best investor (by this problem, anyway) can buy at most four times if they purchase at a lower price each time. One four day sequence (there might be others) of acceptable buys is:

Day    2  5  6 10
Price 69 68 64 62

PROGRAM NAME: buylow

INPUT FORMAT

Line 1:	N (1 <= N <= 5000), the number of days for which stock prices are available.
Line 2..etc:	A series of N positive space-separated integers (which may require more than one line of data) that tell the price for that day. The integers will fit into 32 bits quite nicely.

SAMPLE INPUT (file buylow.in)

12
68 69 54 64 68 64 70 67
78 62 98 87

OUTPUT FORMAT

Two integers on a single line:

• the length of the longest sequence of decreasing prices
• the number of sequences that have this length

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 OUTPUT (file buylow.out)

4 2

思路：

1、求最长下降子序列，使用记忆数组longest来DP，复杂度n^2；

2、判断重复：数组nxtSame，请看下面例子

//initialize the array "nxtSame" for (int i = 0; i <= days; i ++) nxtSame[i] = size + 1; for (int i = 0; i <= days; i ++){ for (int j = i + 1; j <= days; j ++){ if (longest[i] == longest[j] && prices[i] == prices[j]){ nxtSame[i] = j; break; } } }

index: 0 1 2 3 4 5 6 7 prices: 6 8 5 5 5 8 5 3 longest: 1 1 2 1 2 1 2 3 nxtSame: 5001 3 4 5 6 5001 5001 5001

如上，以index=2，4，和6为结尾的最长串的长度同样是2，而且price同样是5，当我们计数到index=7的时候，因为longest[7]=3，所以我们在index=0~6的范围寻找longest[*]=2的目标，明显index=2，4，和6都符合，但是nxtSame[2] = 4，这说明以index=4结尾的下降序列已经包含了所有以index=2结尾的下降序列。同理的，index=6又覆盖了index=4。所以排除重复以后，这个情况中，所有longest[7]=3的序列都是由longest[6]=2生成的

3、小技巧，在数组末尾补上一个0，这样可以减少代码量

 

 

代码：高精度类自己写过，稍微修改一下就用上了~~~

/* ID: geterns1 PROG: buylow LANG: C++ */ #include <iostream> #include <fstream> #include <cstdio> #include <cmath> #include <cstdlib> #include <cstring> #include <algorithm> using namespace std; /***********************************************************************************************************/ /* max lent & base short: 32767 2 100 long: 2147483647 4 10000 long long: 9223372036854775807 9 1000000000 */ typedef long long baseType; const int baseSize = 10; const int baseLent = 18; const baseType base = 1000000000000000000; class unsigned_integer{ private: int head; baseType list[baseSize]; public: unsigned_integer(){ head = baseSize - 1; list[head] = 0; } void setAs1(){ head = baseSize - 1; list[head] = 1; } void printDecLn(){ printf("%lld", list[head]); for (int i = head + 1; i < baseSize; i ++) printf("%018lld", list[i]); printf("/n"); } friend bool additionV2(unsigned_integer &, const unsigned_integer &); }; bool additionV2(unsigned_integer &a, const unsigned_integer &b){ if (&a == &b) return false; bool carry = false; if (a.head > b.head){ for (int i = baseSize - 1; i >= a.head; i --){ a.list[i] += b.list[i]; if (carry) a.list[i] ++; if (a.list[i] >= base){ a.list[i] -= base; carry = true; } else carry = false; } for (int i = a.head - 1; i >= b.head; i --){ a.list[i] = b.list[i]; if (carry){ a.list[i] ++; if (a.list[i] >= base){ a.list[i] -= base; carry = true; } else carry = false; } } a.head = b.head; } else{ for (int i = baseSize - 1; i >= b.head; i --){ a.list[i] += b.list[i]; if (carry) a.list[i] ++; if (a.list[i] >= base){ a.list[i] -= base; carry = true; } else carry = false; } for (int i = b.head - 1; i >= a.head; i --){ if (carry){ a.list[i] ++; if (a.list[i] >= baseSize){ a.list[i] -= baseSize; carry = true; } else{ carry = false; break; } } } } if (carry && a.head) a.list[-- a.head] = 1; return true; } /***********************************************************************************************************/ // typedef unsigned int uint; // const int size = 5000; // int days; uint prices[size + 1]; // int longest[size + 1]; //a momery list for DP int nxtSame[size + 1]; //next "same position" whice means (prices[i] == prices[nxtSame[i]] && longest[i] == longest[nxtSame[i]]) unsigned_integer strCnt[size + 1]; int main(){ freopen("buylow.in", "r", stdin); freopen("buylow.out", "w", stdout); // scanf("%d", &days); for (int i = 0; i < days; i ++) scanf("%u", prices + i); prices[days] = 0; //DP longest length int temp; for (int i = 0; i <= days; i ++){ temp = 1; for (int j = 0; j < i; j ++){ if (prices[j] > prices[i]){ if (longest[j] + 1 > temp) temp = longest[j] + 1; } } longest[i] = temp; } printf("%d ", longest[days] - 1); //initialize the array "nxtSame" for (int i = 0; i <= days; i ++) nxtSame[i] = size + 1; for (int i = 0; i <= days; i ++){ for (int j = i + 1; j <= days; j ++){ if (longest[i] == longest[j] && prices[i] == prices[j]){ nxtSame[i] = j; break; } } } //count for (int i = 0; i <= days; i ++){ if (longest[i] == 1) strCnt[i].setAs1(); else{ for (int j = 0; j < i; j ++){ if (longest[j] == longest[i] - 1 && prices[j] > prices[i] && nxtSame[j] > i) additionV2(strCnt[i], strCnt[j]); } } } strCnt[days].printDecLn(); // fclose(stdin); fclose(stdout); return 0; }