#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
using namespace std;
typedef vector<int> iarray;
typedef vector<iarray> imatrix;
typedef vector<unsigned short int> uarray;
typedef vector<uarray> umatrix;

/*int unhappy(const iarray &col, int from, int to)
{
    vector<int> num(2);
    for ( iarray::const_iterator it=col.begin()+from ; it!=col.begin()+to ;
          ++it )
        num[*it]++;
    //cout<<"("<<from<<","<<to<<")="<<num[0]<<","<<num[1]<<endl;
    return num[0]*num[1];
}*/
#define unhappy(a,b,c) unh[b][c]

int main(void)
{
    int n, k;
    int i, j, l;

    cin>>n>>k;
    iarray color;
    for ( i=0 ; i<n ; i++ ) {
        int c;
        cin>>c;
        color.push_back(c);
    }
    umatrix unh(n+1, uarray(n+1));
    vector<int> num(2);
    for ( i=0 ; i<n ; i++ ) {
        num[0]=num[1]=0;
        for ( j=i ; j<n ; j++ ) {
            num[color[j]]++;
            unh[i][j+1] = (unsigned short)(num[0]*num[1]);
        }
    }
    imatrix table(n+1, iarray(2/*k+1*/));
    for ( i= 1 ;i<=n ; i++ )
        table[i][1]=unhappy(color, 0, i);
    for ( j=2 ; j<=k ; j++ ) {
        for ( i=j ; i<=n+j-k ; i++ ) {
            int rec=INT_MAX;
            for ( l=1 ; l<i ; l++ ) {
                int test=table[i-l][(j-1)&1]+unhappy(color, i-l, i);
                if ( rec>test )
                    rec=test;
            }
            table[i][j&1]=rec;
        }
    }
    cout<<table[n][k&1]<<endl;
}