有没有python的解法
查看原帖
有没有python的解法
451267
qq1732137199楼主2021/5/14 20:44

萌新求助,试了几种方法,不是内存超了,就是超时了 n = int(input()) l1 = []

la = [] lb = []

lg=[]

lk=[]

for i in range(n): a, b, g, k = map(int, input().split()) l1.append((i + 1, a, b, g, k)) la.append(a + g) lb.append(b + k) # lg.append(g) # lk.append(k) x, y = map(int, input().split()) am = max(max(la), x) bm = max(max(lb), y)

l2 = [[-1] * (am + 1) for i in range(bm + 1)]

l2 = [[-1] * (10001) for i in range(10001)] for i in l1: m = i[3] - i[1] n = i[4] - i[2] for o in range(m + 1): for p in range(n + 1): l2[ i[1]+ o][ i[2]+ p] = i[0] print(l2[x][y])

2021/5/14 20:44
加载中...