题解 | 买卖股票的最好时机(一)--leetcode 121

import sys

# for line in sys.stdin:
#     a = line.split()
#     print(int(a[0]) + int(a[1]))

def func(n,prices):
    if n ==0:
        print(0)
    minprice=prices[0]
    maxprofit=0
    for i in range(1,n):
        minprice=min(minprice,prices[i])
        maxprofit=max(maxprofit,prices[i]-minprice)
    print(maxprofit)
def solver():
    n=int(input())
    prices=list(map(int,input().split()))
    #print(n,prices)
    func(n,prices)


solver()