結果
問題 | No.1117 数列分割 |
ユーザー | hiromi_ayase |
提出日時 | 2020-07-21 04:28:28 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 563 ms / 3,000 ms |
コード長 | 3,772 bytes |
コンパイル時間 | 2,382 ms |
コンパイル使用メモリ | 89,680 KB |
実行使用メモリ | 172,156 KB |
最終ジャッジ日時 | 2023-08-26 19:25:23 |
合計ジャッジ時間 | 11,942 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 63 ms
50,844 KB |
testcase_01 | AC | 63 ms
50,688 KB |
testcase_02 | AC | 63 ms
51,028 KB |
testcase_03 | AC | 172 ms
61,848 KB |
testcase_04 | AC | 167 ms
62,304 KB |
testcase_05 | AC | 64 ms
50,980 KB |
testcase_06 | AC | 78 ms
52,132 KB |
testcase_07 | AC | 77 ms
52,240 KB |
testcase_08 | AC | 195 ms
62,608 KB |
testcase_09 | AC | 146 ms
58,124 KB |
testcase_10 | AC | 178 ms
62,092 KB |
testcase_11 | AC | 295 ms
79,976 KB |
testcase_12 | AC | 292 ms
89,088 KB |
testcase_13 | AC | 290 ms
103,296 KB |
testcase_14 | AC | 395 ms
105,208 KB |
testcase_15 | AC | 348 ms
111,172 KB |
testcase_16 | AC | 467 ms
115,880 KB |
testcase_17 | AC | 214 ms
60,452 KB |
testcase_18 | AC | 524 ms
171,640 KB |
testcase_19 | AC | 528 ms
172,052 KB |
testcase_20 | AC | 412 ms
109,012 KB |
testcase_21 | AC | 540 ms
171,800 KB |
testcase_22 | AC | 556 ms
172,072 KB |
testcase_23 | AC | 557 ms
172,156 KB |
testcase_24 | AC | 540 ms
169,204 KB |
testcase_25 | AC | 563 ms
170,080 KB |
testcase_26 | AC | 64 ms
50,848 KB |
testcase_27 | AC | 173 ms
59,872 KB |
testcase_28 | AC | 186 ms
60,128 KB |
ソースコード
import java.util.ArrayDeque; import java.util.Arrays; import java.util.Deque; 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; long[] sum = new long[n + 1]; for (int i = 0; i < n; i++) { sum[i + 1] = sum[i] + a[i]; } Deque<long[]> q1 = new ArrayDeque<>(); Deque<long[]> q2 = new ArrayDeque<>(); for (int j = 1; j <= k; j++) { q1.clear(); q2.clear(); for (int i = 1; i <= n; i++) { if (n - i < k - j) break; long v1 = dp[i - 1][j - 1] - sum[i - 1]; long v2 = dp[i - 1][j - 1] + sum[i - 1]; long[] e1 = { v1, i }; long[] e2 = { v2, i }; while (q1.size() > 0 && q1.peekLast()[0] <= e1[0]) { q1.pollLast(); } while (q2.size() > 0 && q2.peekLast()[0] <= e2[0]) { q2.pollLast(); } q1.addLast(e1); q2.addLast(e2); if (q1.peekFirst()[1] == i - m) { q1.pollFirst(); } if (q2.peekFirst()[1] == i - m) { q2.pollFirst(); } dp[i][j] = Math.max(dp[i][j], q1.peekFirst()[0] + sum[i]); dp[i][j] = Math.max(dp[i][j], q2.peekFirst()[0] - sum[i]); } } 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)); } }