链接：
https://www.nowcoder.com/acm/contest/106/K
来源：牛客网
来源：牛客网
It’s universally acknowledged that there’re innumerable trees in the campus of HUST.
Now you're going to walk through a large forest. There is a path consisting of N stones winding its way to the other side of the forest. Between every two stones there is a distance. Let d
i indicates the distance between the stone i and i+1.Initially you stand at the first stone, and your target is the N-th stone. You must stand in a stone all the time, and you can stride over arbitrary number of stones in one step. If you stepped from the stone i to the stone j, you stride a span of (d
i+d
i+1+...+d
j-1). But there is a limitation. You're so tired that you want to walk through the forest in no more than K steps. And to walk more comfortably, you have to minimize the distance of largest step.
输入描述:
The first line contains two integer N and K
)
as described above.
Then the next line N-1 positive integer followed, indicating the distance between two adjacent stone
)
.
输出描述:
An integer, the minimum distance of the largest step.