度小满2019小招 编程

题目一：火车站台

#!/usr/bin/python
# -*- coding: utf-8 -*-
n=int(input())
train=[]
ans=0
t=0
for i in range(n):
    x=list(map(int,input().split()))
    train.append((x[0],1))
    train.append((x[1],-1))
train.sort()
print(train)
for i in train:
    if i[1]==1:
        t+=1
    else:
        t-=1
    ans=max(ans,t)
print(ans)

题目二：商品交易

#!/usr/bin/python
# -*- coding: utf-8 -*-
n=int(input())
x=list(map(int,input().split()))

def shangpin(x):
    i=0
    ans=0
    cnt=0
    while i<len(x):
        while(i<len(x)-1 and x[i+1]<=x[i] ):
            i+=1
        xmin=x[i]
        i+=1
        while(i<len(x)-1 and x[i+1]>=x[i] ):
            i+=1
        if(i<len(x)):
            ans+=x[i]-xmin
            cnt+=2
    return ans,cnt
ans,cnt=shangpin(x)
print(ans, cnt)