//POJ 1160 解题报告:(引用以下两位大牛,写得不错)
//http://www.608088.com/show-51-1.html
//http://hi.baidu.com/rain_bow_joy/blog/item/ba85e922219b455b9822edfd.html
#include <cstdio>
#include <cmath>
int dist[310][310];
int v[310];
int dp[310][310];
int main()
{
int n,m;
scanf("%d%d",&n,&m);
for (int i=1;i<=n;i++)
{
scanf("%d",&v[i]);
}
for (int i=1;i<=n;i++)
for (int j=i+1;j<=n;j++)
{
int mid=(i+j)>>1;
for (int k=i;k<=j;k++)
dist[i][j]+=abs(v[k]-v[mid]);
}
for (int i=1;i<=m;i++)
for (int j=1;j<=n;j++)
dp[i][j]=9999999;
for (int i=1;i<=n;i++)
dp[1][i]=dist[1][i];
for (int i=2;i<=m;i++)
for (int j=i;j<=n;j++)
{
for (int k=i;k<=j;k++)
if (dp[i][j]>dp[i-1][k-1]+dist[k][j])
dp[i][j]=dp[i-1][k-1]+dist[k][j];
}
printf("%d/n",dp[m][n]);
return 0;
}