题解 | #买卖股票的最好时机(一)#

#include<iostream>
#include<algorithm>
using namespace std;
int price[100000];
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n,maxn = 0,minprice = 10000;
    cin >> n;
    for(int i = 0;i < n;++i)
        cin >> price[i];
    for(int i = 0;i < n;++i){
        minprice = min(minprice,price[i]);
        maxn = max(maxn,price[i] - minprice);
    }
    cout << maxn;
}