#nullable enable #region var (_input, _iter) = (Array.Empty(), 0); T I() where T : IParsable { while (_iter >= _input.Length) (_input, _iter) = (Console.ReadLine()!.Split(' ', StringSplitOptions.RemoveEmptyEntries), 0); return T.Parse(_input[_iter++], null); } #endregion var n = I(); var b = Math.Min(I(), 3); var c = I(); var az = Enumerable.Range(0, n).Select(_ => I()).ToArray(); var s = 0L; foreach (var a in az) s += a; var op = new Op(); var dp = new SegmentTree([.. Enumerable.Range(0, n + 1).Select(_ => op.IdentityElement)], op); dp.Set(0, 0); var last = 0L; var suc = op.IdentityElement; for (var i = 1; i <= n; i++) { var a = az[i - 1]; var min = dp.Product(Math.Max(0, i - c), i - 1); dp.Set(i, min + a); if (b > 2) dp.Set(i - 1, Math.Min(suc, dp.Product(i - 1, i))); suc = last + a; last = min + a; } var ans = s - dp.Product(n - c, n + 1); Console.WriteLine(ans); readonly struct Op : ISegmentTreeOperator { public long IdentityElement => long.MaxValue / 8; public long Operation(long x, long y) => long.Min(x, y); } interface ISegmentTreeOperator { TMonoid IdentityElement { get; } TMonoid Operation(TMonoid x, TMonoid y); } class SegmentTree where TOperator : struct, ISegmentTreeOperator { public int BaseSize { get; protected init; } protected int Height { get; init; } protected TOperator Op { get; init; } protected TMonoid[] Values { get; init; } public SegmentTree(TMonoid[] initial, TOperator op = default) { Op = op; (BaseSize, Height) = (1, 0); while (BaseSize < initial.Length) (BaseSize, Height) = (BaseSize << 1, Height + 1); var size = BaseSize << 1; Values = new TMonoid[size]; var values = Values; for (var i = 0; i < size; i++) values[i] = op.IdentityElement; for (var i = 0; i < initial.Length; i++) values[i + BaseSize] = initial[i]; for (var i = BaseSize - 1; i > 0; i--) Update(values, i); } public TMonoid Product(int l, int r) { (l, r) = (l + BaseSize, r + BaseSize); var (resL, resR) = (Op.IdentityElement, Op.IdentityElement); var values = Values; while (l < r) { if ((l & 1) == 1) resL = Op.Operation(resL, values[l++]); if ((r & 1) == 1) resR = Op.Operation(values[--r], resR); (l, r) = (l >> 1, r >> 1); } return Op.Operation(resL, resR); } public void Set(int index, TMonoid value) { var j = index + BaseSize; var values = Values; values[j] = value; while ((j >>= 1) > 0) Update(values, j); } protected void Update(TMonoid[] values, int k) { values[k] = Op.Operation(values[k << 1], values[(k << 1) + 1]); } }