kick start 2020 round A workout Python solution

最新推荐文章于 2024-10-08 10:25:28 发布

一杯敬月光

最新推荐文章于 2024-10-08 10:25:28 发布

阅读量649

点赞数 1

文章标签：算法 python 动态规划

本文链接：https://blog.csdn.net/sinat_32682001/article/details/105109608

版权

题目链接 round A workout

import math 
T=int(input())
for i in range(T):
    N,K=[int(s) for s in input().split(" ")] 
    session=[int(s) for s in input().split(" ")]
    sess_diff=[session[x+1]-session[x] for x in range(len(session)-1)]
    
    di_max=max(sess_diff)
    ll=1
    rr=di_max
    while ll<rr: 
        mid=int((ll+rr)/2)
        if sum(map(lambda x: math.ceil(x/mid)-1,sess_diff)) <= K:
            rr=mid
        else:
            ll=mid+1 
    ans=ll

    print("Case #{}: {}".format(i+1, ans))