結果

問題 No.1117 数列分割
ユーザー hiromi_ayasehiromi_ayase
提出日時 2020-07-21 04:05:53
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,562 ms / 3,000 ms
コード長 5,699 bytes
コンパイル時間 2,344 ms
コンパイル使用メモリ 80,960 KB
実行使用メモリ 131,672 KB
最終ジャッジ日時 2023-08-26 18:55:33
合計ジャッジ時間 22,700 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 66 ms
50,872 KB
testcase_01 AC 66 ms
50,980 KB
testcase_02 AC 65 ms
51,156 KB
testcase_03 AC 245 ms
59,032 KB
testcase_04 AC 257 ms
59,132 KB
testcase_05 AC 65 ms
51,016 KB
testcase_06 AC 85 ms
52,408 KB
testcase_07 AC 89 ms
52,568 KB
testcase_08 AC 251 ms
58,736 KB
testcase_09 AC 167 ms
54,228 KB
testcase_10 AC 264 ms
59,212 KB
testcase_11 AC 654 ms
79,568 KB
testcase_12 AC 779 ms
79,272 KB
testcase_13 AC 633 ms
87,568 KB
testcase_14 AC 920 ms
86,620 KB
testcase_15 AC 1,051 ms
89,716 KB
testcase_16 AC 1,405 ms
93,968 KB
testcase_17 AC 296 ms
59,396 KB
testcase_18 AC 1,381 ms
130,760 KB
testcase_19 AC 1,562 ms
130,792 KB
testcase_20 AC 1,224 ms
87,180 KB
testcase_21 AC 1,350 ms
130,708 KB
testcase_22 AC 1,405 ms
131,404 KB
testcase_23 AC 1,399 ms
131,672 KB
testcase_24 AC 1,337 ms
131,388 KB
testcase_25 AC 1,359 ms
131,504 KB
testcase_26 AC 66 ms
51,180 KB
testcase_27 AC 237 ms
57,164 KB
testcase_28 AC 220 ms
54,796 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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++) {
        if (n - i < k - j)
          break;
        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() {
      @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));
  }
}
0