結果
問題 | No.1117 数列分割 |
ユーザー | hiromi_ayase |
提出日時 | 2020-07-18 20:00:43 |
言語 | Java21 (openjdk 21) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,013 bytes |
コンパイル時間 | 2,110 ms |
コンパイル使用メモリ | 89,380 KB |
実行使用メモリ | 84,332 KB |
最終ジャッジ日時 | 2024-05-08 03:58:36 |
合計ジャッジ時間 | 11,119 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 70 ms
43,600 KB |
testcase_01 | AC | 69 ms
38,224 KB |
testcase_02 | AC | 72 ms
38,540 KB |
testcase_03 | AC | 176 ms
46,580 KB |
testcase_04 | AC | 594 ms
46,440 KB |
testcase_05 | AC | 68 ms
38,136 KB |
testcase_06 | AC | 89 ms
39,196 KB |
testcase_07 | AC | 95 ms
39,332 KB |
testcase_08 | AC | 1,189 ms
46,540 KB |
testcase_09 | AC | 203 ms
40,776 KB |
testcase_10 | AC | 1,571 ms
46,672 KB |
testcase_11 | TLE | - |
testcase_12 | -- | - |
testcase_13 | -- | - |
testcase_14 | -- | - |
testcase_15 | -- | - |
testcase_16 | -- | - |
testcase_17 | -- | - |
testcase_18 | -- | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
ソースコード
import java.util.Arrays; public class Main { private static void solve() { int n = ni(); int k = ni(); int m = ni(); long[] a = nal(n); long[][] dp = new long[n + 1][k + 1]; for (long[] v : dp) Arrays.fill(v, Long.MIN_VALUE / 2); dp[0][0] = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j <= k; j++) { long sum = 0; if (n - i < k - j) continue; for (int s = 1; s <= m; s++) { if (i - s < 0) break; sum += a[i - s]; dp[i][j] = Math.max(dp[i][j], dp[i - s][j - 1] + Math.abs(sum)); } } } System.out.println(dp[n][k]); } public static void main(String[] args) { new Thread(null, new Runnable() { @Override public void run() { long start = System.currentTimeMillis(); String debug = args.length > 0 ? args[0] : null; if (debug != null) { try { is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug)); } catch (Exception e) { throw new RuntimeException(e); } } reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768); solve(); out.flush(); tr((System.currentTimeMillis() - start) + "ms"); } }, "", 64000000).start(); } private static java.io.InputStream is = System.in; private static java.io.PrintWriter out = new java.io.PrintWriter(System.out); private static java.util.StringTokenizer tokenizer = null; private static java.io.BufferedReader reader; public static String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new java.util.StringTokenizer(reader.readLine()); } catch (Exception e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } private static double nd() { return Double.parseDouble(next()); } private static long nl() { return Long.parseLong(next()); } private static int[] na(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = ni(); return a; } private static char[] ns() { return next().toCharArray(); } private static long[] nal(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nl(); return a; } private static int[][] ntable(int n, int m) { int[][] table = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[i][j] = ni(); } } return table; } private static int[][] nlist(int n, int m) { int[][] table = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[j][i] = ni(); } } return table; } private static int ni() { return Integer.parseInt(next()); } private static void tr(Object... o) { if (is != System.in) System.out.println(java.util.Arrays.deepToString(o)); } }