ograda-coci
Matija needs to paint his old fence. The fence is made from N planks, each 1 cm in width and varying in height. To do this easy and fast, he bought himself a Super Paint Roller Deluxe. The paint roller is X cm wide. The Super Paint Roller Deluxe model comes with a catch, however. Matija must at all times touch the planks with full width of the roller, otherwise paint drops all around and stains everything. Also, the roller must always be parallel to the ground to prevent leakage. This means that in order for Matija to use the roller safely, he needs to select X planks, and paint them from bottom to the top of the lowest plank in one swoop. Then he selects some other X planks, paints them and so on.
This leaves parts of some planks unpainted. Matija will have to paint such parts with a toothbrush. This is obviously quite tedious so he asked you to help him paint as much as possible using the Super Paint Roller Deluxe. Since there is more than one way to do this he is also interested in the painting that requires the minimal number of swoops.
The second line of input contains N positive integers, smaller than 1 000 000, heights of planks in the fence.
5 3
5 3 4 4 5 Output
3
210 3
3 3 3 3 3 3 3 3 3 3Output
0
47 4
1 2 3 4 3 2 1Output
4
41. sample description:
Matija needs two swoops with his roller - one to paint planks 1, 2 and 3 to the height of 3 cm, the other to paint planks 3, 4 and 5 to the height of 4 cm. Note that 3 cm2 (2 cm2 on plank 1 and 1 cm2 on plank 5) are left unpainted. Also, 3 cm2 on plank 3 are painted over twice, but that's OK.
Submit solution
Coming laterThe grading service will be connected in a later migration step. You can inspect the task and your previous results now.