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
题目大意:有n天,每天股票有个单价,开始时你有100刀,你可以买进或卖出股票,求一顿操作后,你手里的钱最多有多少;
思路:贪心,在最便宜的时候没买入,在最高点卖出;
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
typedef long long ll;
int main()
{
ll d;
while(~scanf("%lld",&d))
{
ll a[400];
for(ll i=0;i<d;i++)
scanf("%lld",&a[i]);
ll ans=100;
ll b;
ll s;
ll mark=d;
ll flag=0,num;
for(ll i=0;i<d;i++)
{
if(a[i]<=ans)
{
b=a[i];
if(ans/a[i]>=100000)num=100000;
else num=ans/a[i];
flag=1;
mark=i;
break;
}
}
for(ll i=mark+1;i<d;i++)
{
if(flag==0)
{
if(a[i]<=ans)
{
b=a[i];
if(ans/a[i]>=100000)num=100000;
else num=ans/a[i];
flag=1;
}
}
if(a[i]<a[i-1])
{
if(flag==2)
{
ans=ans+(num*s);
if(a[i]<=ans)
{
b=a[i];
if(ans/a[i]>=100000)num=100000;
else num=ans/a[i];
flag=1;
}else
{
flag=0;
}
}else if(flag==1)
{
if(a[i]<=ans)
{
b=a[i];
if(ans/a[i]>=100000)num=100000;
else num=ans/a[i];
}
}
}else if(a[i]>a[i-1])
{
if(flag==1)
{
ans=ans-num*b;
s=a[i];
flag=2;
}else if(flag==2)
{
s=a[i];
}
}
}
if(flag==2)
ans=ans+(num*s);
printf("%lld\n",ans);
}
return 0;
}
思路二:买入时:在第k天买入,如果k+1天单价小于第k天,在第k天卖出,则在第k+1天买入;
卖出时:在第k天卖出,如果k+1天单价大于第k天,在第k天重新买入,则在第k+1天卖出;