Difficult times lie ahead of Ivica and his Holding – a group of \(N\) Croatian companies
that are in his ownership. Each of these companies is in debt so the state sent its
attorneys to take everything away from him. We have exclusively found out that
Ivica managed to make a deal with the state to leave him certain companies in spite
of the massive debt. Which ones? We found that out as well.
The state attorneys have laid out \(N\) proprietary papers of Ivica’s companies on the
table. The debt of first company is written on the first paper \(A\)1, the debt of the
second company is written on \(A\)2, . . . and the debt of the last company is written
on the last paper \(A@@RISE_MATH_BLOCK_0@@L\),
\(A@@RISE_MATH_BLOCK_1@@R\) in his ownership, where \(L\) and \(R\) represent the positions in an array of papers on the table.
Fortunately for Ivica, the attorneys are (also) corrupt. They will force him to take the same contiguous
subarray as agreed upon (from \(L-th\) to \(R-th\) paper), but they will let him swap any two papers on the
table for a specific cost. More precisely, swapping papers at positions \(i\) and \(j\) will cost him |\(i - j\)| kunas
(Croatian currency). Ivica is desperate. He has only \(K\) kunas in his pocket which he now wishes to spend
in such a way that the sum of debts of companies he is left with is as small as possible.
Help Ivica achieve his goal.

Subtask
Score
Constraints
1
22
\(N \le 13\) and \(R = N\)
2
33
\(N \le 50\) and \(R = N\)
3
33
\(N \le 50\)
4
22
No additional constraints.

The first line contains four spa\(ce-se\)parated integers \(N\), \(L\), \(R\) (\(1 \le L \le R \le N \le 100\)) and \(K\) (\(0 \le K\) ≤
10 000) from the task description.
The second line contains \(N\) integers \(A@@RISE_MATH_BLOCK_0@@i \le 10^{6}\)) from the task description.

You should output a single integer which represents the smallest amount of total debt Ivica will have if he
spends his \(K\) kunas optimally.

생성자가 기록되지 않았습니다.

출처 COCI 2019/2020 Contest 4