NKLEAVES - Leaves
One beautiful autumn day Radu and Mars noticed that the garden alley where they usually spend time is rather full of leaves. They decided to gather all the leaves in exactly K piles. The alley is a straight line and they established a coordinate system on the alley, with the origine at the beginning of the alley.
There are N leaves of various weights on the alley, all lined up, and the distance between each consecutive leaves is 1. More precisely the first leaf is at coordinate 1, the second at coordinate 2, ... , the N-th at coordinate N. Initially the two guys are at coordinate N.
The leaf gathering operation takes place as Radu and Mars leave the garden, so the leaves can only be moved to the left. The cost of moving a leaf is equal to its weight times the distance it is moved. Obviously one of the K piles will be at coordinate 1, but the rest can be anywhere.
Find out the total minimum cost of gathering the N leaves in exactly K piles.
The input contains on the first line two positive integers, N and K, separated by a space, having the significance given above. The following N lines contain N positive integers representing the weights of the leaves (line i+1 contains the weight of the leaf located at coordinate i).
The output will contain a single line on which the minimum cost for gathering all the leaves in exactly K piles will be written.
- 0 < N < 100 001
- 0 < K < 11, K < N
- 0 < the weight of any leaf < 1 001
Input 5 2 1 2 3 4 5 Output 13
It would be best to form the 2 piles in points 1 and 4. Leaves 1, 2 and 3 are taken to coordinate 1, and 4 and 5 are taken to coordinate 4. The total cost is:
1 * 0 + 2 * 1 + 3 * 2 + 4 * 0 + 5 * 1 = 13
O(n) Greedy in one go!
Does not getting a full score indicate TLE or WA?
Fast IO not required, divide and conquer optimisation passes.
great ques on the application of convex hull
what does not getting a full score indicate?
A full score solution might require some IO optimizations.