結果
問題 | No.1117 数列分割 |
ユーザー | 37zigen |
提出日時 | 2020-07-24 15:42:25 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 669 ms / 3,000 ms |
コード長 | 3,656 bytes |
コンパイル時間 | 2,183 ms |
コンパイル使用メモリ | 75,120 KB |
実行使用メモリ | 170,500 KB |
最終ジャッジ日時 | 2023-09-07 12:32:28 |
合計ジャッジ時間 | 13,824 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 105 ms
128,852 KB |
testcase_01 | AC | 113 ms
128,344 KB |
testcase_02 | AC | 111 ms
128,444 KB |
testcase_03 | AC | 252 ms
166,332 KB |
testcase_04 | AC | 227 ms
165,824 KB |
testcase_05 | AC | 109 ms
128,372 KB |
testcase_06 | AC | 123 ms
131,248 KB |
testcase_07 | AC | 121 ms
131,672 KB |
testcase_08 | AC | 230 ms
166,288 KB |
testcase_09 | AC | 186 ms
133,680 KB |
testcase_10 | AC | 223 ms
166,176 KB |
testcase_11 | AC | 327 ms
170,352 KB |
testcase_12 | AC | 320 ms
170,496 KB |
testcase_13 | AC | 352 ms
169,060 KB |
testcase_14 | AC | 369 ms
170,424 KB |
testcase_15 | AC | 406 ms
170,500 KB |
testcase_16 | AC | 442 ms
170,116 KB |
testcase_17 | AC | 240 ms
166,280 KB |
testcase_18 | AC | 650 ms
169,500 KB |
testcase_19 | AC | 669 ms
170,080 KB |
testcase_20 | AC | 404 ms
170,384 KB |
testcase_21 | AC | 610 ms
169,676 KB |
testcase_22 | AC | 596 ms
170,232 KB |
testcase_23 | AC | 602 ms
170,220 KB |
testcase_24 | AC | 583 ms
170,296 KB |
testcase_25 | AC | 594 ms
170,468 KB |
testcase_26 | AC | 104 ms
128,448 KB |
testcase_27 | AC | 227 ms
142,756 KB |
testcase_28 | AC | 223 ms
142,660 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.util.ArrayDeque; import java.util.Arrays; import java.util.Deque; import java.util.NoSuchElementException; class SlidingQueue { class Pair { long v,cnt; public Pair(long v,long cnt) { this.v=v; this.cnt=cnt; } } int sz=0; Deque<Pair> st=new ArrayDeque<>(); final long INF=Long.MAX_VALUE/3; void push(long v) { int cnt=1; while (!st.isEmpty() && st.peekLast().v <= v) { cnt+=st.peekLast().cnt; st.pollLast(); } st.addLast(new Pair(v,cnt)); ++sz; } void pop() { st.peekFirst().cnt--; if (st.peekFirst().cnt==0) st.pollFirst(); --sz; } long max() { if (st.isEmpty()) { return -INF; } else { return st.peekFirst().v; } } } public class Main { public static void main(String[] args) { new Main().run(); } void run() { FastScanner sc=new FastScanner(); int N=sc.nextInt(); int K=sc.nextInt(); int M=sc.nextInt(); long[] A=new long[N]; long[] s=new long[N+1]; for (int i=0;i<N;++i) { A[i]=sc.nextLong(); } for (int i=1;i<=N;++i) { s[i]=A[i-1]+s[i-1]; } long[][] dp=new long[3001][3001]; Arrays.fill(dp[0], -Long.MAX_VALUE/3); dp[0][0]=0; for (int t=0;t<K;++t) { SlidingQueue sa=new SlidingQueue(); SlidingQueue sb=new SlidingQueue(); for (int i=0;i<N;++i) { sa.push(dp[t][i]-s[i]); sb.push(dp[t][i]+s[i]); if (sa.sz>M) sa.pop(); if (sb.sz>M) sb.pop(); dp[t+1][i+1]=Math.max(sa.max()+s[i+1],sb.max()-s[i+1]); } } System.out.println(dp[K][N]); } void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));} class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;} private boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;} public boolean hasNext() { skipUnprintable(); return hasNextByte();} public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { return (int)nextLong(); } } }