#define STOPIT
#include <bits/stdc++.h>
#define loop(n) for (int ngtkana_is_genius = 0; ngtkana_is_genius < int(n); ngtkana_is_genius++)
#define rep(i, begin, end) for(int i = int(begin); i < int(end); i++)
#define all(v) v.begin(), v.end()
#define rand(l, r) std::uniform_int_distribution<>(l, r)(mt)
using lint = long long;
auto mt = std::mt19937_64(std::random_device{}());
auto cmn = [](auto& a, auto b){if (a > b) {a = b; return true;} return false;};
auto cmx = [](auto& a, auto b){if (a < b) {a = b; return true;} return false;};
void debug_impl() { std::cerr << std::endl; }
template <typename Head, typename... Tail>
void debug_impl(Head head, Tail... tail){
  std::cerr << " " << head;
  debug_impl(tail...);
}
#ifdef STOPIT
#define debug(...) 0
#else
#define debug(...)\
do {\
  std::cerr << std::boolalpha << "[" << #__VA_ARGS__ << "]:";\
  debug_impl(__VA_ARGS__);\
  std::cerr << std::noboolalpha;\
} while (false)
#endif

template < typename Container, typename Value = typename Container::value_type, std::enable_if_t<!std::is_same< Container, std::string >::value, std::nullptr_t> = nullptr>
std::istream& operator>> (std::istream& is, Container& v)
  { for (auto & x : v) { is >> x; } return is; }

template < typename Container, typename Value = typename Container::value_type, std::enable_if_t<!std::is_same< Container, std::string >::value, std::nullptr_t> = nullptr >
std::ostream& operator<< (std::ostream& os, Container const& v) {
 os << "{";
  for (auto it = v.begin(); it != v.end(); it++)
    {os << (it != v.begin() ? "," : "") << *it;}
  return os << "}";
}

template < template < typename ... > class Tuple,  typename... Args, std::size_t ... Inds, std::size_t = std::tuple_size< Tuple < Args ... > >::value >
std::istream& tuple_input_impl(std::istream& os, Tuple<Args...>& tuple, std::integer_sequence<std::size_t, Inds...>)
  { (void)std::initializer_list<int>{((void)(os >> std::get< Inds >(tuple)), 0)...}; return os; }
template < template < typename ... > class Tuple,  typename... Args, std::size_t = std::tuple_size< Tuple < Args ... > >::value >
std::istream& operator>> (std::istream& os, Tuple<Args...>& tuple)
  { return tuple_input_impl(os, tuple, std::index_sequence_for<Args...>()); }

template < template < typename ... > class Tuple,  typename... Args, std::size_t ... Inds, std::size_t = std::tuple_size< Tuple < Args ... > >::value >
std::ostream& tuple_output_impl(std::ostream& os, const Tuple<Args...>& tuple, std::integer_sequence<std::size_t, Inds...>)
  { os << "("; (void)std::initializer_list<int>{((void)(os << (Inds > 0 ? "," : "") << std::get< Inds >(tuple)), 0)...}; return os << ")"; }
template < template < typename ... > class Tuple,  typename... Args, std::size_t = std::tuple_size< Tuple < Args ... > >::value >
std::ostream& operator<< (std::ostream& os, const Tuple<Args...>& tuple)
 { return tuple_output_impl(os, tuple, std::index_sequence_for<Args...>()); }

int main() {
  std::cin.tie(0); std::cin.sync_with_stdio(false);
  lint n, K; std::cin >> n >> K;
  std::vector< lint > a(n); std::cin >> a;
  std::vector< std::map< lint, lint, std::greater< lint > > > maps(n + 1);
  maps.at(0)[0] = 0;

  auto act = [&] (auto&& map, lint key, lint value) {
    auto found = map.find(key);
    if (found == map.end()) {
      map[key] = value;
    } else {
      cmn(found->second, value);
    }
  };

  auto renew = [&] (lint x) {
    std::vector< std::map< lint, lint, std::greater< lint > > > new_maps(n + 1);
    rep(i,0,n+1) {
      for (auto& pair : maps.at(i)) {
        lint j, k; std::tie(j,k) = pair;
        if (j <= x) {
          act(new_maps.at(i), x, k+x-j);
          act(new_maps.at(i+1), j, k);
        } else {
          act(new_maps.at(i), x, k);
          act(new_maps.at(i+1), j, k);
        }
      }
    }
    std::swap(maps, new_maps);
  };

  auto reduce = [&] {
    for (auto & map : maps) {
      std::map< lint, lint, std::greater< lint > > new_map;
      for (auto & pair : map) {
        lint j, k; std::tie(j, k) = pair;
        if (!new_map.empty()) {
          lint pj, pk; std::tie(pj,pk) = *new_map.rbegin();
          assert(pj >= j);
          if (j == pj || pk - pj >= k - j) {
            new_map.erase(std::prev(new_map.end()));
          }
        }
        new_map[j] = k;
      }
      std::swap(map, new_map);
    }
  };

  for (lint x : a) {
    renew(x);
    reduce();
    debug(maps);
  }
  lint inf = std::numeric_limits< lint >::max();
  lint ans = inf;
  rep(i,0,K+1) {
    auto const& map = maps.at(i);
    for (auto const& pair : map) {
      lint j, k; std::tie(j,k) = pair;
      debug(j,k);
      cmn(ans, k);
    }
  }
  assert(ans != inf);
  std::cout << ans << std::endl;
  return 0;
}


Measured memory_bytes: 768