Submission #1003656
Source Code Expand
import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class Main { static InputStream is; static PrintWriter out; static String INPUT = ""; static void solve() { int n = ni(), m = ni(), K = ni(); int[] a = na(n); long[] dp = new long[n]; for(int j = 1;j <= K;j++){ if(j == 1){ for(int i = 0;i < n;i++)dp[i] = a[i]; continue; } long[] ndp = new long[n]; int[] dq = new int[n]; int qh = 0, qt = 0; for(int i = 0;i < n;i++){ while(qt < qh && dq[qt] < i-m)qt++; if(qt < qh){ ndp[i] = dp[dq[qt]] + (long)a[i] * j; }else{ ndp[i] = Long.MIN_VALUE / 10; } while(qt < qh && dp[dq[qh-1]] < dp[i])qh--; dq[qh++] = i; } dp = ndp; } out.println(Arrays.stream(dp).max().getAsLong()); } public 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(int[] 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){ if(l >= r)return 0L; long min = Long.MAX_VALUE; 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 static void main(String[] args) throws Exception { long S = System.currentTimeMillis(); is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); solve(); out.flush(); long G = System.currentTimeMillis(); tr(G-S+"ms"); } private static boolean eof() { if(lenbuf == -1)return true; int lptr = ptrbuf; while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false; try { is.mark(1000); while(true){ int b = is.read(); if(b == -1){ is.reset(); return true; }else if(!isSpaceChar(b)){ is.reset(); return false; } } } catch (IOException e) { return true; } } private static byte[] inbuf = new byte[1024]; static int lenbuf = 0, ptrbuf = 0; private static 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 static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } // private static boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); } private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private static double nd() { return Double.parseDouble(ns()); } private static char nc() { return (char)skip(); } private static String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private static 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 static 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 static int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private static 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 static 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) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); } }
Submission Info
Submission Time | |
---|---|
Task | A - Struck Out |
User | uwi |
Language | Java8 (OpenJDK 1.8.0) |
Score | 700 |
Code Size | 6255 Byte |
Status | AC |
Exec Time | 809 ms |
Memory | 138972 KB |
Judge Result
Set Name | Sample | subtask1 | subtask2 | subtask3 | All | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | 200 / 200 | 300 / 300 | 100 / 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 | 245 ms | 14036 KB |
sample_2.txt | AC | 192 ms | 13520 KB |
sample_3.txt | AC | 191 ms | 13500 KB |
subtask_1_1.txt | AC | 189 ms | 14020 KB |
subtask_1_2.txt | AC | 276 ms | 28228 KB |
subtask_1_3.txt | AC | 770 ms | 138836 KB |
subtask_1_4.txt | AC | 211 ms | 16084 KB |
subtask_1_5.txt | AC | 242 ms | 20132 KB |
subtask_1_6.txt | AC | 197 ms | 14540 KB |
subtask_1_7.txt | AC | 418 ms | 49524 KB |
subtask_1_8.txt | AC | 784 ms | 138832 KB |
subtask_1_9.txt | AC | 203 ms | 15352 KB |
subtask_2_1.txt | AC | 187 ms | 13640 KB |
subtask_2_2.txt | AC | 202 ms | 14156 KB |
subtask_2_3.txt | AC | 187 ms | 13768 KB |
subtask_2_4.txt | AC | 195 ms | 14160 KB |
subtask_2_5.txt | AC | 262 ms | 14156 KB |
subtask_2_6.txt | AC | 206 ms | 14284 KB |
subtask_2_7.txt | AC | 199 ms | 14544 KB |
subtask_2_8.txt | AC | 202 ms | 13776 KB |
subtask_2_9.txt | AC | 213 ms | 14156 KB |
subtask_3_1.txt | AC | 284 ms | 30916 KB |
subtask_3_2.txt | AC | 320 ms | 30848 KB |
subtask_3_3.txt | AC | 295 ms | 31016 KB |
subtask_3_4.txt | AC | 275 ms | 29616 KB |
subtask_3_5.txt | AC | 231 ms | 15468 KB |
subtask_3_6.txt | AC | 261 ms | 28460 KB |
subtask_3_7.txt | AC | 283 ms | 31332 KB |
subtask_3_8.txt | AC | 220 ms | 17748 KB |
subtask_3_9.txt | AC | 290 ms | 30760 KB |
subtask_4_1.txt | AC | 792 ms | 138916 KB |
subtask_4_10.txt | AC | 731 ms | 138876 KB |
subtask_4_11.txt | AC | 781 ms | 138752 KB |
subtask_4_12.txt | AC | 795 ms | 138824 KB |
subtask_4_13.txt | AC | 809 ms | 138924 KB |
subtask_4_2.txt | AC | 801 ms | 138788 KB |
subtask_4_3.txt | AC | 773 ms | 138972 KB |
subtask_4_4.txt | AC | 801 ms | 138916 KB |
subtask_4_5.txt | AC | 697 ms | 100648 KB |
subtask_4_6.txt | AC | 272 ms | 28764 KB |
subtask_4_7.txt | AC | 521 ms | 77220 KB |
subtask_4_8.txt | AC | 801 ms | 138016 KB |
subtask_4_9.txt | AC | 495 ms | 77228 KB |