Submission #2076825
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(); } SegmentTree[] seg = new SegmentTree[k+1]; for(int i = 0; i < k+1; i++) seg[i] = new SegmentTree(); seg[1].update(0,a[0]); for(int i = 0; i < n; i++){ for(int p = 0; p < k; p++){ long max = 0; for(int j = Math.max(0, i-m); j < i; j++){ long tmp = seg[p].query(j,j+1); max = Math.max(max, tmp+(p+1)*a[i]); } long res = Math.max(max, seg[p+1].query(i,i+1)); seg[p+1].update(i, res); } } out.println(seg[k].query(0,n)); } class SegmentTree { int SIZE = 1 << 18; long[][] seg; SegmentTree() { this.seg = new long[2 * SIZE][1]; for(int i=0;i<2*SIZE;++i){ seg[i][0] = 0; } } long comb(long ans1, long ans2){ return Math.max(ans1, ans2); } void update(int x, long value) { x += SIZE - 1; this.seg[x][0] = value; while (x > 0) { x = (x - 1) / 2; this.seg[x][0] = comb(this.seg[2 * x + 1][0], this.seg[2 * x + 2][0]); } } long query(int a,int b,int l,int r,int k){ if(a<=l&&r<=b) return seg[k][0]; if(b<=l||r<=a) return 0; long ans1=query(a,b,l,(l+r)/2,2*k+1); long ans2=query(a,b,(l+r)/2,r,2*k+2); return comb(ans1, ans2); } long query(int l, int r) { return query(l,r,0,SIZE,0); } } 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 | 0 |
Code Size | 5244 Byte |
Status | TLE |
Exec Time | 2110 ms |
Memory | 475176 KB |
Judge Result
Set Name | Sample | subtask1 | subtask2 | subtask3 | All | ||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | 0 / 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, 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 | 347 ms | 90452 KB |
sample_2.txt | AC | 332 ms | 74836 KB |
sample_3.txt | AC | 673 ms | 121684 KB |
subtask_1_1.txt | TLE | 2110 ms | 471764 KB |
subtask_1_2.txt | TLE | 2110 ms | 470096 KB |
subtask_1_3.txt | TLE | 2110 ms | 467148 KB |
subtask_1_4.txt | TLE | 2110 ms | 474156 KB |
subtask_1_5.txt | TLE | 2109 ms | 124260 KB |
subtask_1_6.txt | TLE | 2110 ms | 470220 KB |
subtask_1_7.txt | TLE | 2110 ms | 465340 KB |
subtask_1_8.txt | TLE | 2110 ms | 467348 KB |
subtask_1_9.txt | TLE | 2110 ms | 475176 KB |
subtask_2_1.txt | TLE | 2110 ms | 471248 KB |
subtask_2_2.txt | AC | 1461 ms | 252368 KB |
subtask_2_3.txt | AC | 1899 ms | 440788 KB |
subtask_2_4.txt | TLE | 2110 ms | 469972 KB |
subtask_2_5.txt | TLE | 2110 ms | 473172 KB |
subtask_2_6.txt | TLE | 2110 ms | 470480 KB |
subtask_2_7.txt | TLE | 2110 ms | 469588 KB |
subtask_2_8.txt | TLE | 2110 ms | 469204 KB |
subtask_2_9.txt | TLE | 2110 ms | 470476 KB |
subtask_3_1.txt | TLE | 2110 ms | 464708 KB |
subtask_3_2.txt | TLE | 2110 ms | 463956 KB |
subtask_3_3.txt | TLE | 2110 ms | 464084 KB |
subtask_3_4.txt | TLE | 2110 ms | 464420 KB |
subtask_3_5.txt | TLE | 2110 ms | 471224 KB |
subtask_3_6.txt | TLE | 2106 ms | 339156 KB |
subtask_3_7.txt | TLE | 2110 ms | 463948 KB |
subtask_3_8.txt | TLE | 2110 ms | 471852 KB |
subtask_3_9.txt | TLE | 2110 ms | 465876 KB |
subtask_4_1.txt | TLE | 2110 ms | 467408 KB |
subtask_4_10.txt | TLE | 2110 ms | 466000 KB |
subtask_4_11.txt | TLE | 2110 ms | 467792 KB |
subtask_4_12.txt | TLE | 2110 ms | 462784 KB |
subtask_4_13.txt | TLE | 2110 ms | 463932 KB |
subtask_4_2.txt | TLE | 2110 ms | 463944 KB |
subtask_4_3.txt | TLE | 2110 ms | 462412 KB |
subtask_4_4.txt | TLE | 2110 ms | 465732 KB |
subtask_4_5.txt | TLE | 2110 ms | 465232 KB |
subtask_4_6.txt | TLE | 2110 ms | 464084 KB |
subtask_4_7.txt | TLE | 2110 ms | 465740 KB |
subtask_4_8.txt | TLE | 2110 ms | 465480 KB |
subtask_4_9.txt | TLE | 2110 ms | 466000 KB |