CCF CSP 201609-1/2 最大波动/火车购票 python

201609-1 最大波动

满分实现：

n = int(input())
data = list(map(int,input().split()))
cha = []
for i in range(1,n):
    cha.append(abs(data[i]-data[i-1]))
print(max(cha))

201609-2 火车购票

按自己的思路写的稍微复杂了点，但是感觉应该很好理解！满分实现：

n = int(input())
data = list(map(int,input().split()))
seat = []
ticket = []

for i in range(20):
    seat.append([])
    for j in range(5):
        seat[i].append(i*5+j+1)

for i in range(n):

    order = data[i]

    ticket.append([])
 

    flag = False

    num = 0
    
    for j in range(len(seat)):
        if num == order:
            flag = True
            break
        else:
            if order <= 5-seat[j].count(-1):
                for k in range(5):
                    if num == order:
                       flag = True
                       break
                    else:
                        if seat[j][k]!=-1:
                            num+=1
                            ticket[i].append(seat[j][k])
                            seat[j][k]=-1
            
    if flag == False:
        for j in range(len(seat)):
             if num == order:
                 flag = True
                 break
             for k in range(5):
                 if num == order:
                     break
                 else:
                     if seat[j][k]!=-1:
                            num += 1
                            ticket[i].append(seat[j][k])
                            seat[j][k]=-1

    for t in range(len(ticket[i])):
        if t == len(ticket[i])-1:
            print(ticket[i][t],end="\n")
        else:
            print(ticket[i][t],end=" ")