A modern programming language that makes developers happier.

kotlinlang

<https://codeforces.com/contest/1170/problem/E>

how to optimize? <https://codeforces.com/contest/1170/submission/54760029> -&gt; 11 tries -&gt; <https://codeforces.com/contest/1170/submission/54765547>

*SPOILERS*
My solution:
<https://codeforces.com/contest/1170/submission/54766047>
I have created array `s` where `s[i]` is sum of door widths from `a(0)` to a(i-1).
When I need to place doors starting from door `i` and I have `len` width available I do binary search for possible doors placed from `i` to `n` and I know the sum of all door’s width from `i` to `j` using `s[j] - s[i]`.