CSU - 2026 - Daydreaming Stockbroker（DP）

Gina Reed, the famous stockbroker, is having a slow day at work, and between rounds of solitaire she is daydreaming. Foretelling the future is hard, but imagine if you could just go back in time and use your knowledge of stock price history in order to maximize your profits!

Now Gina starts to wonder: if she were to go back in time a few days and bring a measly $100 with her, how much money could she make by just buying and selling stock in Rollercoaster Inc. (the most volatile stock in existence) at the right times? Would she earn enough to retire comfortably in a mansion on Tenerife?

Photo by liz west on flickr

Note that Gina can not buy fractional shares, she must buy whole shares in Rollercoaster Inc. The total number of shares in Rollercoaster Inc. is 100 000, so Gina can not own more than 100 000 shares at any time. In Gina’s daydream, the world is nice and simple: there are no fees for buying and selling stocks, stock prices change only once per day, and her trading does not influence the valuation of the stock.

Input
The first line of input contains an integer d (1 ≤ d ≤ 365), the number of days that Gina goes back in time in her daydream. Then follow d lines, the i’th of which contains an integer pi (1 ≤ pi ≤ 500) giving the price at which Gina can buy or sell stock in Rollercoaster Inc. on day i. Days are ordered from oldest to newest.

Output
Output the maximum possible amount of money Gina can have on the last day. Note that the answer may exceed 232.

Sample Input
6
100
200
100
150
125
300
Sample Output
650

[分析]
只要判断a[i]>a[i-1],那么就可以买。
不用考虑买了，几天后再收，因为你买了再卖，再买价格是一样的。
所以就要有升值，就能赚钱，然后注意不能超过100000

[代码]

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<ctime>
using namespace std;
typedef long long ll;
ll a[400];
int main()
{
    int n;
    while (scanf("%d", &n) != EOF)
    {
        ll ans = 100;
        scanf("%lld",&a[0]);
        for (int i = 1; i < n; i++)
        {
            scanf("%lld", &a[i]);
            if (a[i] > a[i - 1])
            {
                if(ans / a[i - 1]<= 100000)ans=a[i] * (ans / a[i - 1]) + ans%a[i - 1];
                else ans = (a[i]-a[i-1]) * 100000 + ans;
            }
        }
        printf("%lld\n", ans);
    }
}