結果
問題 | No.1117 数列分割 |
ユーザー | 37zigen |
提出日時 | 2020-07-24 15:47:01 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 648 ms / 3,000 ms |
コード長 | 3,707 bytes |
コンパイル時間 | 2,303 ms |
コンパイル使用メモリ | 75,204 KB |
実行使用メモリ | 57,952 KB |
最終ジャッジ日時 | 2023-09-07 12:40:22 |
合計ジャッジ時間 | 13,312 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 45 ms
48,984 KB |
testcase_01 | AC | 44 ms
49,012 KB |
testcase_02 | AC | 45 ms
49,068 KB |
testcase_03 | AC | 227 ms
57,652 KB |
testcase_04 | AC | 219 ms
57,524 KB |
testcase_05 | AC | 44 ms
49,024 KB |
testcase_06 | AC | 77 ms
51,972 KB |
testcase_07 | AC | 75 ms
51,236 KB |
testcase_08 | AC | 213 ms
57,600 KB |
testcase_09 | AC | 121 ms
55,496 KB |
testcase_10 | AC | 211 ms
57,368 KB |
testcase_11 | AC | 313 ms
55,500 KB |
testcase_12 | AC | 321 ms
57,952 KB |
testcase_13 | AC | 364 ms
57,520 KB |
testcase_14 | AC | 380 ms
57,600 KB |
testcase_15 | AC | 433 ms
57,620 KB |
testcase_16 | AC | 449 ms
55,532 KB |
testcase_17 | AC | 208 ms
56,788 KB |
testcase_18 | AC | 648 ms
57,276 KB |
testcase_19 | AC | 641 ms
57,292 KB |
testcase_20 | AC | 402 ms
56,812 KB |
testcase_21 | AC | 589 ms
57,288 KB |
testcase_22 | AC | 595 ms
55,640 KB |
testcase_23 | AC | 608 ms
57,220 KB |
testcase_24 | AC | 583 ms
57,524 KB |
testcase_25 | AC | 591 ms
57,432 KB |
testcase_26 | AC | 46 ms
49,208 KB |
testcase_27 | AC | 175 ms
56,216 KB |
testcase_28 | AC | 179 ms
56,460 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[2][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%2][i]-s[i]); sb.push(dp[t%2][i]+s[i]); if (sa.sz>M) sa.pop(); if (sb.sz>M) sb.pop(); dp[(t+1)%2][i+1]=Math.max(sa.max()+s[i+1],sb.max()-s[i+1]); } Arrays.fill(dp[t%2], -Long.MAX_VALUE/3); } System.out.println(dp[K%2][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(); } } }