CSU——D: Daydreaming Stockbroker

Description

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?

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

思路：这题就是直接模拟就可以了，利用数组下标表示可能拥有的股票数,数据表示剩余的金钱.
每次只有两种操作,买入和卖出，但是要注意不能超过十万股，开始以为是限制条件，根本就没想着用，真是智障了。

#include<iostream>
#include<string.h> 
#include<set>
using namespace std;
typedef long long ll;
set<ll>s;ll m[100005]={};
int main()
{
        int n;
while(cin>>n)
{
s.insert(0);
m[0]=100;
while(n--)
{
ll temp;
cin>>temp;
for(set<ll>::iterator it=s.begin();it!=s.end();it++)
{
ll x=(*it)+m[(*it)]/temp;
                                ll y=m[(*it)]%temp;
if(x>100000)
{
y+=(x-100000)*temp;
x=100000;
}
s.insert(x);
m[x]=max(m[x],y);
m[0]=max(m[0],m[(*it)]+(*it)*temp);
}
}
cout<<map[0]<<endl;
}
return 0;
}