Lanci
레이팅 미적용의견: 0
\(2^{nd}\) round, November \(10^{th}\), 2012
Mirko has found N chains in his attic. Each chain consists of some number of links, where each link
has at most two adjacent links. Each link can be opened or closed, so it is possible to separate chains or
connect them into a longer chain. Mirko would like to connect all chains into one huge chain, while
opening and closing as few links as possible.
For example, if Mirko has only three chains, each consisting of only one link, he can open one of them,
use it to connect the remaining two and close it:
Given the number of chains and the length of each chain, find the minimum number of links that
Mirko has to open and close in order to bind them all in darkness one long chain.
The first line of input contains the positive integer N (\(2 \le N \le 500\,000\)), the number of chains.
The second line of input contains N positive integers L_{i} (\(1 \le L_{i} \le 1\,000\,000\)), the lengths of individual
chains.
The first and only line of output must contain the required minimum number of links.
2
3 313
1 1 115
4 3 5 7 93Clarification of the first example: Mirko can open the last link of the first chain, connect it with the
first link of the second chain and close it.
Clarification of the third example: Here it is best to completely take apart the chain of length 3,
using its three links to connect the remaining chains.
평가 및 의견
Lanci
Log in to rate problems.
아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.
풀이 제출
Lanci