题解 | #牛牛的数组匹配#

牛牛的数组匹配

http://www.nowcoder.com/practice/3d3406f4a7eb4346b025cc592be5b875

m, n = map(int, input().split()) a, b = list(map(int, input().split())), list(map(int, input().split())) c = sum(a) d, e, end = 0, 0, c x, y = 0, n - 1 for i in range(n): for j in range(i, n): d += b[j] if d >= c:

print('dc', d, c)

        f = abs(d - b[j] - c)
        e = abs(d - c)

print(i, j, e, f)

        minm, minn, mid = (i, j - 1, f) if f < e else (i, j, e)
        x, y, end = (x, y, end) if end < mid else (minm, minn, mid)

print(minm, minn, mid, end, x, y)

        break
d = 0

print(*b[x:y + 1])

全部评论

相关推荐

评论
点赞
收藏
分享

创作者周榜

更多
牛客网
牛客网在线编程
牛客网题解
牛客企业服务