https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/
f[i]表示以i点卖出的收益 对于i我们在[1,i-1]找到一个最小的值
class Solution {
public:
int maxProfit(vector<int>& prices)
{
int f[100010]={0};
int last=1e9;
int ans=0;
for(int i=0;i<prices.size();i++)
{
f[i]=max(prices[i]-last,0);
last=min(last,prices[i]);
ans=max(ans,f[i]);
}
return ans;
}
};