package contest; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class Adv17 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(), m = ni(); int[] w = na(n); int ret = -9999999; // include { int[][] dp = new int[n][n+1]; // last num int[][] maxs = new int[n][n+1]; for(int i = 0;i < n;i++){ Arrays.fill(dp[i], -9999999); Arrays.fill(maxs[i], -9999999); } dp[0][1] = 0; maxs[0][1] = 0; for(int i = 1;i < n;i++){ for(int k = 1;k <= n;k++){ int max = -9999999; if(i-2 >= 0)max = Math.max(max, maxs[i-2][k-1]); max = Math.max(max, dp[i-1][k-1] + (k > 1 ? w[i-1] : 0)); dp[i][k] = max; maxs[i][k] = Math.max(dp[i][k], maxs[i-1][k]); } } for(int i = 0;i < n-1;i++){ ret = Math.max(ret, dp[i][m]); } ret = Math.max(ret, dp[n-1][m] + w[n-1]); } // not include { int[][] dp = new int[n][n+1]; // last num int[][] maxs = new int[n][n+1]; for(int i = 0;i < n;i++){ Arrays.fill(dp[i], -9999999); Arrays.fill(maxs[i], -9999999); } dp[0][0] = 0; maxs[0][0] = 0; for(int i = 1;i < n;i++){ for(int k = 1;k <= n;k++){ int max = -9999999; if(i-2 >= 0)max = Math.max(max, maxs[i-2][k-1]); max = Math.max(max, dp[i-1][k-1] + (k > 1 ? w[i-1] : 0)); dp[i][k] = max; maxs[i][k] = Math.max(dp[i][k], maxs[i-1][k]); } } for(int i = 0;i < n;i++){ ret = Math.max(ret, dp[i][m]); } } out.println(ret); } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); } public static void main(String[] args) throws Exception { new Adv17().run(); } private byte[] inbuf = new byte[1024]; private int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private int ni() { int num = 0, b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }