|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|5 초||512 MB||1||1||1||100.000%|
You work in Bookcase Solidity United (BSU), a company that tests furniture under various load and measures its reliability. Right now, they are testing a bookcase with $n$ shelves, placed from top to bottom.
The bookcase will be tested by putting heavy iridium balls on some of the shelves and observing them break. We assume that all balls are the same and BSU has infinitely many of them.
The engineers measured that the $i$-th shelf from the top can endure strictly less than $a_i$ balls. If there are $x \ge a_i$ balls on the shelf, it breaks and the balls fall. If there are no unbroken shelves, all the balls fall on the floor. Otherwise, $\left\lfloor \frac x 2 \right\rfloor$ balls fall on the nearest unbroken shelf $j$ below, and the rest of the balls fall on the floor. (Don't worry, the floor is solid enough to hold all the balls.) If, after this operation, the number of balls on the $j$-th shelf is not less than $a_j$, then the $j$-th shelf breaks, the balls fall from the shelf in the same way as described above, and so on. The process terminates either when all the balls are on the floor or the next shelf is solid enough to hold the balls which fell on it.
To measure the reliability, the employees of BSU put the balls one by one on some of the shelves. The goal is to break $k$ upmost shelves using the minimum possible number of balls. As trying various placement variants is costly, time-consuming, and produces much noise from heavy falling balls, the management of the company has ordered you to calculate the least number of balls to break $k$ upmost shelves, for each $k$ from $1$ to $n$.
The first line contains an integer $n$, the number of shelves in the bookcase ($1 \le n \le 70$).
The second line contains $n$ integers $a_i$, where $a_i$ is the minimal number of balls that break the $i$-th shelf ($1 \le a_i \le 150$). The shelves are numbered from top to bottom.
Print $n$ integers. The $k$-th integer equals the minimal number of balls needed to break $k$ upmost shelves.
3 8 1 2
8 8 8
5 10 3 3 8 4
10 10 11 17 17
In the first example, we can place eight balls one by one on the first shelf. The shelf will surely break, and $\left\lfloor \frac 82\right\rfloor = 4$ balls will fall on the second shelf. The second shelf now holds $4 > 1$ balls, so it breaks and $\left\lfloor \frac 42\right\rfloor = 2$ balls fall to the third shelf. The third shelf also breaks, and all the balls fall onto the floor. Thus, the answer is $8$.
In the second example, to break all the shelves, we can put $2$ balls on the third shelf, then we put $3$ balls on the second shelf, after that we put $10$ balls on the first shelf, and, finally, we put $2$ balls on the fourth shelf. So, we put $2 + 3 + 10 + 2 = 17$ balls.