Submission #2076986
Source Code Expand
import java.io.*; import java.util.*; import java.math.*; // import java.awt.Point; public class Main { InputStream is; PrintWriter out; String INPUT = ""; long mod = 1_000_000_007; int inf = Integer.MAX_VALUE; void solve(){ int n = ni(); int m = ni(); int k = ni(); long[] a = new long[n]; for(int i = 0; i < n; i++){ a[i] = nl(); } Deque<Integer>[] dq = new ArrayDeque[k+1]; for(int i = 0; i < k+1; i++) dq[i] = new ArrayDeque<>(); dq[0].add(-1); long[][] dp = new long[k+1][n]; for(int i = 0; i < n; i++){ for(int p = 0; p < Math.min(k,i+1); p++){ if(dq[p].isEmpty()) continue; int tmp = dq[p].pop(); long res = 0; if(tmp!=-1) res = dp[p][tmp]; dp[p+1][i] = Math.max(dp[p+1][i], res + (p+1)*a[i]); if(tmp>=Math.max(0,i-m)){ dq[p].push(tmp); } } for(int p = 0; p <= k; p++){ while(!dq[p].isEmpty()){ int tmp = dq[p].removeLast(); if(dp[p][tmp]>=dp[p][i]){ dq[p].add(tmp); break; } } dq[p].add(i); } } long ans = 0; for(int i = 0; i < n; i++){ ans = Math.max(ans, dp[k][i]); } out.println(ans); } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); } public static void main(String[] args) throws Exception { new Main().run(); } private byte[] inbuf = new byte[1024]; private int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b) && b != ' ')){ sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private int ni() { int num = 0, b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }
Submission Info
Submission Time | |
---|---|
Task | A - Struck Out |
User | yuya178 |
Language | Java8 (OpenJDK 1.8.0) |
Score | 500 |
Code Size | 4733 Byte |
Status | TLE |
Exec Time | 2120 ms |
Memory | 577272 KB |
Compile Error
Note: ./Main.java uses unchecked or unsafe operations. Note: Recompile with -Xlint:unchecked for details.
Judge Result
Set Name | Sample | subtask1 | subtask2 | subtask3 | All | ||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | 200 / 200 | 300 / 300 | 0 / 100 | ||||||||||||||||
Status |
|
|
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample_1.txt, sample_2.txt, sample_3.txt |
subtask1 | sample_2.txt, subtask_1_1.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
subtask2 | sample_1.txt, sample_2.txt, sample_3.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt |
subtask3 | sample_1.txt, sample_2.txt, sample_3.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt, subtask_3_1.txt, subtask_3_2.txt, subtask_3_3.txt, subtask_3_4.txt, subtask_3_5.txt, subtask_3_6.txt, subtask_3_7.txt, subtask_3_8.txt, subtask_3_9.txt |
All | sample_1.txt, sample_2.txt, sample_3.txt, sample_1.txt, sample_2.txt, sample_3.txt, subtask_1_1.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt, subtask_3_1.txt, subtask_3_2.txt, subtask_3_3.txt, subtask_3_4.txt, subtask_3_5.txt, subtask_3_6.txt, subtask_3_7.txt, subtask_3_8.txt, subtask_3_9.txt, subtask_4_1.txt, subtask_4_10.txt, subtask_4_11.txt, subtask_4_12.txt, subtask_4_13.txt, subtask_4_2.txt, subtask_4_3.txt, subtask_4_4.txt, subtask_4_5.txt, subtask_4_6.txt, subtask_4_7.txt, subtask_4_8.txt, subtask_4_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_1.txt | AC | 69 ms | 20436 KB |
sample_2.txt | AC | 69 ms | 21076 KB |
sample_3.txt | AC | 69 ms | 19796 KB |
subtask_1_1.txt | AC | 76 ms | 18644 KB |
subtask_1_2.txt | AC | 352 ms | 113888 KB |
subtask_1_3.txt | TLE | 2115 ms | 559060 KB |
subtask_1_4.txt | AC | 135 ms | 29680 KB |
subtask_1_5.txt | AC | 195 ms | 49520 KB |
subtask_1_6.txt | AC | 111 ms | 21972 KB |
subtask_1_7.txt | AC | 766 ms | 262188 KB |
subtask_1_8.txt | TLE | 2116 ms | 562156 KB |
subtask_1_9.txt | AC | 138 ms | 26744 KB |
subtask_2_1.txt | AC | 93 ms | 17748 KB |
subtask_2_2.txt | AC | 86 ms | 19412 KB |
subtask_2_3.txt | AC | 79 ms | 18516 KB |
subtask_2_4.txt | AC | 81 ms | 18644 KB |
subtask_2_5.txt | AC | 73 ms | 16980 KB |
subtask_2_6.txt | AC | 71 ms | 18388 KB |
subtask_2_7.txt | AC | 83 ms | 20436 KB |
subtask_2_8.txt | AC | 83 ms | 21332 KB |
subtask_2_9.txt | AC | 88 ms | 19412 KB |
subtask_3_1.txt | AC | 338 ms | 113608 KB |
subtask_3_2.txt | AC | 336 ms | 112024 KB |
subtask_3_3.txt | AC | 333 ms | 113748 KB |
subtask_3_4.txt | AC | 306 ms | 86336 KB |
subtask_3_5.txt | AC | 151 ms | 27512 KB |
subtask_3_6.txt | AC | 227 ms | 70688 KB |
subtask_3_7.txt | AC | 374 ms | 117612 KB |
subtask_3_8.txt | AC | 182 ms | 42628 KB |
subtask_3_9.txt | AC | 309 ms | 115184 KB |
subtask_4_1.txt | TLE | 2116 ms | 577272 KB |
subtask_4_10.txt | MLE | 1913 ms | 510756 KB |
subtask_4_11.txt | TLE | 2116 ms | 557028 KB |
subtask_4_12.txt | TLE | 2119 ms | 552244 KB |
subtask_4_13.txt | TLE | 2116 ms | 570524 KB |
subtask_4_2.txt | TLE | 2120 ms | 569040 KB |
subtask_4_3.txt | TLE | 2116 ms | 560112 KB |
subtask_4_4.txt | TLE | 2095 ms | 556624 KB |
subtask_4_5.txt | AC | 1956 ms | 474728 KB |
subtask_4_6.txt | AC | 296 ms | 83556 KB |
subtask_4_7.txt | AC | 1177 ms | 339688 KB |
subtask_4_8.txt | TLE | 2120 ms | 566584 KB |
subtask_4_9.txt | AC | 1017 ms | 300520 KB |