結果
| 問題 | No.1117 数列分割 |
| ユーザー |
 hiromi_ayase
|
| 提出日時 | 2020-07-21 04:00:50 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 2,872 ms / 3,000 ms |
| コード長 | 5,655 bytes |
| コンパイル時間 | 2,392 ms |
| コンパイル使用メモリ | 90,564 KB |
| 実行使用メモリ | 134,528 KB |
| 最終ジャッジ日時 | 2024-12-25 19:34:20 |
| 合計ジャッジ時間 | 34,793 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 26 |
ソースコード
import java.util.Arrays;class SegmentTreeRMQL {public int M, H, N;public long[] st;public SegmentTreeRMQL(int n) {N = n;M = Integer.highestOneBit(Math.max(N - 1, 1)) << 2;H = M >>> 1;st = new long[M];Arrays.fill(st, 0, M, Long.MAX_VALUE);}public SegmentTreeRMQL(long[] a) {N = a.length;M = Integer.highestOneBit(Math.max(N - 1, 1)) << 2;H = M >>> 1;st = new long[M];for (int i = 0; i < N; i++) {st[H + i] = a[i];}Arrays.fill(st, H + N, M, Long.MAX_VALUE);for (int i = H - 1; i >= 1; i--)propagate(i);}public void update(int pos, long x) {st[H + pos] = x;for (int i = (H + pos) >>> 1; i >= 1; i >>>= 1)propagate(i);}private void propagate(int i) {st[i] = Math.min(st[2 * i], st[2 * i + 1]);}public long minx(int l, int r) {long min = Long.MAX_VALUE;if (l >= r)return min;while (l != 0) {int f = l & -l;if (l + f > r)break;long v = st[(H + l) / f];if (v < min)min = v;l += f;}while (l < r) {int f = r & -r;long v = st[(H + r) / f - 1];if (v < min)min = v;r -= f;}return min;}public long min(int l, int r) {return l >= r ? 0 : min(l, r, 0, H, 1);}private long min(int l, int r, int cl, int cr, int cur) {if (l <= cl && cr <= r) {return st[cur];} else {int mid = cl + cr >>> 1;long ret = Long.MAX_VALUE;if (cl < r && l < mid) {ret = Math.min(ret, min(l, r, cl, mid, 2 * cur));}if (mid < r && l < cr) {ret = Math.min(ret, min(l, r, mid, cr, 2 * cur + 1));}return ret;}}public int firstle(int l, long v) {int cur = H + l;while (true) {if (st[cur] <= v) {if (cur < H) {cur = 2 * cur;} else {return cur - H;}} else {cur++;if ((cur & cur - 1) == 0)return -1;if ((cur & 1) == 0)cur >>>= 1;}}}public int lastle(int l, long v) {int cur = H + l;while (true) {if (st[cur] <= v) {if (cur < H) {cur = 2 * cur + 1;} else {return cur - H;}} else {if ((cur & cur - 1) == 0)return -1;cur--;if ((cur & 1) == 1)cur >>>= 1;}}}}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;SegmentTreeRMQL st1 = new SegmentTreeRMQL(n);SegmentTreeRMQL st2 = new SegmentTreeRMQL(n);long[] sum = new long[n + 1];for (int i = 0; i < n; i++) {sum[i + 1] = sum[i] + a[i];}for (int j = 1; j <= k; j++) {for (int i = 1; i <= n; i++) {st1.update(i - 1, -(dp[i - 1][j - 1] + sum[i - 1]));st2.update(i - 1, -(dp[i - 1][j - 1] - sum[i - 1]));int left = Math.max(0, i - m);dp[i][j] = Math.max(-st1.min(left, i) - sum[i], -st2.min(left, i) + sum[i]);}}System.out.println(dp[n][k]);}public static void main(String[] args) {new Thread(null, new Runnable() {@Overridepublic 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));}}