#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using ll = long long; constexpr int INF = 1001001001; // constexpr int mod = 1000000007; constexpr int mod = 998244353; template inline bool chmax(T& x, T y){ if(x < y){ x = y; return true; } return false; } template inline bool chmin(T& x, T y){ if(x > y){ x = y; return true; } return false; } template struct SegmentTree{ using F = function; int sz; vector seg; const F f; const Monoid M1; SegmentTree(const F f, const Monoid& M1) : f(f), M1(M1) {} SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1) { sz = 1; while(sz < n) sz <<= 1; seg.assign(2 * sz, M1); } void resize(int n){ sz = 1; while(sz < n) sz <<= 1; seg.assign(2 * sz, M1); } void set(int k, const Monoid &x){ seg[k + sz] = x; } void build(){ for(int k = sz - 1; k > 0; --k){ seg[k] = f(seg[k << 1], seg[k << 1 | 1]); } } void update(int k, const Monoid &x){ k += sz; seg[k] = x; while(k >>= 1){ seg[k] = f(seg[k << 1], seg[k << 1 | 1]); } } Monoid query(int a, int b){ Monoid L = M1, R = M1; for(a += sz, b += sz; a < b; a >>= 1, b >>= 1){ if(a & 1) L = f(L, seg[a++]); if(b & 1) R = f(seg[--b], R); } return f(L, R); } Monoid operator[](const int &k) const{ return seg[k + sz]; } // (type = true) : find_last // (type = false) : find_first template int find_subtree(int a, const C &check, Monoid &M, bool type){ while(a < sz){ Monoid nxt = type ? f(seg[a << 1 | type], M) : f(M, seg[a << 1 | type]); if(check(nxt)) a = a << 1 | type; else M = nxt, a = 2 * a + 1 - type; } return a - sz; } template int find_first(int a, const C &check){ Monoid L = M1; if(a <= 0){ if(check(f(L, seg[1]))) return find_subtree(1, check, L, false); return -1; } int b = sz; for(a += sz, b += sz; a < b; a >>= 1, b >>= 1){ if(a & 1){ Monoid nxt = f(L, seg[a]); if(check(nxt)) return find_subtree(a, check, L, false); L = nxt; ++a; } } return -1; } template int find_last(int b, const C &check){ Monoid R = M1; if(b >= sz){ if(check(f(seg[1], R))) return find_subtree(1, check, R, true); return -1; } int a = sz; for(b += sz; a < b; a >>= 1, b >>= 1){ if(b & 1){ Monoid nxt = f(seg[--b], R); if(check(nxt)) return find_subtree(b, check, R, true); R = nxt; } } return -1; } }; constexpr ll inf = 3e+18; auto op = [](ll l, ll r){return max(l, r);}; vector> dp(3005, SegmentTree(3005, op, -inf)); vector> dp2(3005, SegmentTree(3005, op, -inf)); ll S[3005]; int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); int N, K, M, A; cin >> N >> K >> M; for(int i = 0; i < N; ++i){ cin >> A; S[i + 1] = S[i] + A; } dp[0].update(0, 0); dp2[0].update(0, 0); for(int i = 0; i < N; ++i){ for(int k = 1; k <= K; ++k){ ll val = max(dp[k - 1].query(0, i + 1) + S[i + 1], dp2[k - 1].query(0, i + 1) - S[i + 1]); if(val - S[i + 1] > dp[k][i + 1]){ dp[k].update(i + 1, val - S[i + 1]); } if(val + S[i + 1] > dp2[k][i + 1]){ dp2[k].update(i + 1, val + S[i + 1]); } } } cout << max(dp[K][N] + S[N], dp2[K][N] - S[N]) << '\n'; return 0; }