#include <fstream>
#include <algorithm>
#include <deque>

using namespace std;

ifstream fin("ferma.in");
ofstream fout("ferma.out");

int N, K, sol;
int V[10005], dp[1005][10005], S[10005];
deque<int> DQ;

int main()
{
    fin >> N >> K;
    for (int i = 1; i <= N; ++i)
    {
        fin >> V[i];
        S[i] = S[i - 1] + V[i];
    }
    dp[1][1] = max(0, V[1]);
    DQ.push_back(1);
    for (int i = 2; i <= N; ++i)
    {
        dp[1][i] = max(dp[1][i - 1], S[i] - S[DQ.front()]);

        while (!DQ.empty() && S[i] <= S[DQ.back()])
            DQ.pop_back();
        DQ.push_back(i);
    }
    for (int i = 2; i <= K; ++i)
    {
        DQ.clear();
        dp[i][1] = max(0, V[1]);
        DQ.push_back(1);
        for (int j = 2; j <= N; ++j)
        {
            dp[i][j] = max(dp[i][j - 1], dp[i - 1][DQ.front()] + S[j] - S[DQ.front()]);
            while (!DQ.empty() && (dp[i - 1][j] - S[j] >= dp[i - 1][DQ.back()] - S[DQ.back()]))
                DQ.pop_back();
            DQ.push_back(j);
        }
    }

    sol = dp[K][N];

    for (int i = 1; i <= N; ++i)
        dp[1][i] = max(dp[1][i - 1], S[i]);
    for (int i = 2; i <= K; ++i)
    {
        DQ.clear();
        dp[i][1] = max(0, V[1]);
        DQ.push_back(1);
        for (int j = 2; j <= N; ++j)
        {
            dp[i][j] = max(dp[i][j - 1], dp[i - 1][DQ.front()] + S[j] - S[DQ.front()]);
            while (!DQ.empty() && (dp[i - 1][j] - S[j] >= dp[i - 1][DQ.back()] - S[DQ.back()]))
                DQ.pop_back();
            DQ.push_back(j);
        }
    }

    for (int i = 1; i <= N; ++i)
        sol = max(sol, dp[K][i] + S[N] - S[i]);

    fout << sol << '\n';

    fin.close();
    fout.close();
    return 0;
}