Submission #998013
Source Code Expand
import java.io.*; import java.util.*; import java.util.function.IntPredicate; public class Main { class Pair{ int idx; int value; public Pair(int idx, int value){ this.idx = idx; this.value = value; } } int N, M, K; Pair[] A; long[][] dp; public long dfs(int cnt, int idx){ if(cnt > K){ return 0; } if(idx >= N){ return Integer.MIN_VALUE; } if(dp[cnt][idx] != -1) return dp[cnt][idx]; long max = 0; for(int i = idx + 1; i <= idx + M && i < N; i++){ max = Math.max(max, dfs(cnt + 1, i)); } return dp[cnt][idx] = max + A[idx].value * (long)cnt; } public void solve() { N = nextInt(); M = nextInt(); K = nextInt(); A = new Pair[N]; dp = new long[K + 1][N + 1]; for(int i = 0; i < dp.length; i++){ for(int j = 0; j < dp[i].length; j++){ dp[i][j] = -1; } } for(int i = 0; i < N; i++){ A[i] = new Pair(i, nextInt()); } long max = 0; for(int i = 0; i < N; i++){ max = Math.max(max, dfs(1, i)); } out.println(max); } private static PrintWriter out; public static void main(String[] args) { out = new PrintWriter(System.out); new Main().solve(); out.flush(); } public static int nextInt() { int num = 0; String str = next(); boolean minus = false; int i = 0; if (str.charAt(0) == '-') { minus = true; i++; } int len = str.length(); for (; i < len; i++) { char c = str.charAt(i); if (!('0' <= c && c <= '9')) throw new RuntimeException(); num = num * 10 + (c - '0'); } return minus ? -num : num; } public static long nextLong() { long num = 0; String str = next(); boolean minus = false; int i = 0; if (str.charAt(0) == '-') { minus = true; i++; } int len = str.length(); for (; i < len; i++) { char c = str.charAt(i); if (!('0' <= c && c <= '9')) throw new RuntimeException(); num = num * 10l + (c - '0'); } return minus ? -num : num; } public static String next() { int c; while (!isAlNum(c = read())) { } StringBuilder build = new StringBuilder(); build.append((char) c); while (isAlNum(c = read())) { build.append((char) c); } return build.toString(); } private static byte[] inputBuffer = new byte[1024]; private static int bufferLength = 0; private static int bufferIndex = 0; private static int read() { if (bufferLength < 0) throw new RuntimeException(); if (bufferIndex >= bufferLength) { try { bufferLength = System.in.read(inputBuffer); bufferIndex = 0; } catch (IOException e) { throw new RuntimeException(e); } if (bufferLength <= 0) return (bufferLength = -1); } return inputBuffer[bufferIndex++]; } private static boolean isAlNum(int c) { return '!' <= c && c <= '~'; } }
Submission Info
Submission Time | |
---|---|
Task | A - Struck Out |
User | a3636tako |
Language | Java8 (OpenJDK 1.8.0) |
Score | 200 |
Code Size | 2890 Byte |
Status | TLE |
Exec Time | 2118 ms |
Memory | 286492 KB |
Judge Result
Set Name | Sample | subtask1 | subtask2 | subtask3 | All | ||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | 200 / 200 | 0 / 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, 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 | 93 ms | 8148 KB |
sample_2.txt | AC | 94 ms | 8148 KB |
sample_3.txt | AC | 95 ms | 8144 KB |
subtask_1_1.txt | AC | 112 ms | 8660 KB |
subtask_1_2.txt | TLE | 2105 ms | 40144 KB |
subtask_1_3.txt | TLE | 2118 ms | 286372 KB |
subtask_1_4.txt | AC | 1744 ms | 12312 KB |
subtask_1_5.txt | TLE | 2105 ms | 31772 KB |
subtask_1_6.txt | AC | 116 ms | 9168 KB |
subtask_1_7.txt | TLE | 2110 ms | 129272 KB |
subtask_1_8.txt | TLE | 2118 ms | 286352 KB |
subtask_1_9.txt | AC | 174 ms | 10320 KB |
subtask_2_1.txt | AC | 130 ms | 8912 KB |
subtask_2_2.txt | AC | 114 ms | 8784 KB |
subtask_2_3.txt | AC | 116 ms | 8912 KB |
subtask_2_4.txt | AC | 126 ms | 8912 KB |
subtask_2_5.txt | AC | 110 ms | 8528 KB |
subtask_2_6.txt | AC | 96 ms | 8140 KB |
subtask_2_7.txt | AC | 114 ms | 8788 KB |
subtask_2_8.txt | AC | 142 ms | 9168 KB |
subtask_2_9.txt | AC | 130 ms | 9040 KB |
subtask_3_1.txt | TLE | 2106 ms | 53116 KB |
subtask_3_2.txt | TLE | 2106 ms | 53128 KB |
subtask_3_3.txt | TLE | 2106 ms | 52368 KB |
subtask_3_4.txt | TLE | 2106 ms | 49156 KB |
subtask_3_5.txt | AC | 1738 ms | 12200 KB |
subtask_3_6.txt | AC | 1097 ms | 38436 KB |
subtask_3_7.txt | TLE | 2106 ms | 53092 KB |
subtask_3_8.txt | TLE | 2104 ms | 14032 KB |
subtask_3_9.txt | TLE | 2092 ms | 53160 KB |
subtask_4_1.txt | TLE | 2118 ms | 286372 KB |
subtask_4_10.txt | AC | 1167 ms | 286384 KB |
subtask_4_11.txt | TLE | 2118 ms | 285756 KB |
subtask_4_12.txt | TLE | 2118 ms | 286296 KB |
subtask_4_13.txt | TLE | 2118 ms | 284752 KB |
subtask_4_2.txt | TLE | 2118 ms | 286492 KB |
subtask_4_3.txt | TLE | 2118 ms | 286380 KB |
subtask_4_4.txt | TLE | 2118 ms | 286360 KB |
subtask_4_5.txt | TLE | 2118 ms | 284160 KB |
subtask_4_6.txt | TLE | 2106 ms | 48776 KB |
subtask_4_7.txt | TLE | 2112 ms | 154704 KB |
subtask_4_8.txt | TLE | 2118 ms | 286380 KB |
subtask_4_9.txt | TLE | 2111 ms | 139452 KB |