B"You are given an array of n integers a1... an. The cost of a subsegment is the number of unordered pairs of distinct indices within the subsegment that contain equal elements. Split the given array into k non-intersecting non-empty subsegments so that the sum of their costs is minimum possible. Each element should be present in exactly one subsegment. The first line contains two integers n and k (2 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89105, 2 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89k xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89min (n, xe2 x80 x8920)) -- the length of the array and the number of segments you need to split the array into. The next line contains n integers a1, xe2 x80 x89a2, xe2 x80 x89..., xe2 x80 x89an (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89ai xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n) -- the elements of the array. Print single integer: the minimum possible total cost of resulting subsegments. In the first example it's optimal to split the sequence into the following three subsegments: [1], [1, xe2 x80 x893], [3, xe2 x80 x893, xe2 x80 x892, xe2 x80 x891]. The costs are 0, 0 and 1, thus the answer is 1. In the second example it's optimal to split the sequence in two equal halves. The cost for each half is 4. In the third example it's optimal to split the sequence in the following way: [1, xe2 x80 x892, xe2 x80 x892, xe2 x80 x892, xe2 x80 x891], [2, xe2 x80 x891, xe2 x80 x891, xe2 x80 x891, xe2 x80 x892], [2, xe2 x80 x891, xe2 x80 x891]. The costs are 4, 4, 1. "...