Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

divide and conquer

dp

*2500

No tag edit access

The problem statement has recently been changed. View the changes.

×
F. Yet Another Minimization Problem

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou are given an array of *n* integers *a*_{1}... *a*_{n}. 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.

Input

The first line contains two integers *n* and *k* (2 ≤ *n* ≤ 10^{5}, 2 ≤ *k* ≤ *min* (*n*, 20)) — the length of the array and the number of segments you need to split the array into.

The next line contains *n* integers *a*_{1}, *a*_{2}, ..., *a*_{n} (1 ≤ *a*_{i} ≤ *n*) — the elements of the array.

Output

Print single integer: the minimum possible total cost of resulting subsegments.

Examples

Input

7 3

1 1 3 3 3 2 1

Output

1

Input

10 2

1 2 1 2 1 2 1 2 1 2

Output

8

Input

13 3

1 2 2 2 1 2 1 1 1 2 2 1 1

Output

9

Note

In the first example it's optimal to split the sequence into the following three subsegments: [1], [1, 3], [3, 3, 2, 1]. 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, 2, 2, 2, 1], [2, 1, 1, 1, 2], [2, 1, 1]. The costs are 4, 4, 1.

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/25/2024 04:42:55 (j3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|