結果
問題 | No.489 株に挑戦 |
ユーザー | uwi |
提出日時 | 2017-02-24 22:33:09 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 160 ms / 1,000 ms |
コード長 | 5,465 bytes |
コンパイル時間 | 3,407 ms |
コンパイル使用メモリ | 81,940 KB |
実行使用メモリ | 56,468 KB |
最終ジャッジ日時 | 2023-09-27 04:57:39 |
合計ジャッジ時間 | 8,779 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 145 ms
56,312 KB |
testcase_01 | AC | 135 ms
54,496 KB |
testcase_02 | AC | 65 ms
52,092 KB |
testcase_03 | AC | 63 ms
51,024 KB |
testcase_04 | AC | 38 ms
49,440 KB |
testcase_05 | AC | 60 ms
48,988 KB |
testcase_06 | AC | 70 ms
52,268 KB |
testcase_07 | AC | 64 ms
50,828 KB |
testcase_08 | AC | 65 ms
50,912 KB |
testcase_09 | AC | 67 ms
51,828 KB |
testcase_10 | AC | 71 ms
52,424 KB |
testcase_11 | AC | 80 ms
52,772 KB |
testcase_12 | AC | 70 ms
50,884 KB |
testcase_13 | AC | 66 ms
51,180 KB |
testcase_14 | AC | 64 ms
51,828 KB |
testcase_15 | AC | 82 ms
53,612 KB |
testcase_16 | AC | 149 ms
56,172 KB |
testcase_17 | AC | 90 ms
54,012 KB |
testcase_18 | AC | 125 ms
54,252 KB |
testcase_19 | AC | 117 ms
54,324 KB |
testcase_20 | AC | 154 ms
56,468 KB |
testcase_21 | AC | 111 ms
53,992 KB |
testcase_22 | AC | 89 ms
53,604 KB |
testcase_23 | AC | 126 ms
54,132 KB |
testcase_24 | AC | 160 ms
56,228 KB |
testcase_25 | AC | 40 ms
49,360 KB |
testcase_26 | AC | 125 ms
54,536 KB |
testcase_27 | AC | 146 ms
56,228 KB |
testcase_28 | AC | 66 ms
50,808 KB |
testcase_29 | AC | 39 ms
49,340 KB |
testcase_30 | AC | 136 ms
56,388 KB |
testcase_31 | AC | 134 ms
54,080 KB |
testcase_32 | AC | 139 ms
54,072 KB |
testcase_33 | AC | 157 ms
56,108 KB |
testcase_34 | AC | 151 ms
56,148 KB |
testcase_35 | AC | 121 ms
54,140 KB |
testcase_36 | AC | 94 ms
53,632 KB |
testcase_37 | AC | 131 ms
54,056 KB |
ソースコード
package contest170224; 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 E { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(), d = ni(), K = ni(); int[] a = na(n); SegmentTreeRMQPos st = new SegmentTreeRMQPos(a); long max = 0; int argl = n+3, argr = -1; for(int i = 1;i < n;i++){ int min = st.min(Math.max(0, i-d), i); int v = a[i]-min; if(v > max || v == max && st.minpos < argl){ max = v; argl = st.minpos; argr = i; } } if(max == 0){ out.println(0); }else{ out.println((long)max*K); out.println(argl + " " + argr); } } public static class SegmentTreeRMQPos { public int M, H, N; public int[] st; public int[] pos; public SegmentTreeRMQPos(int n) { N = n; M = Integer.highestOneBit(Math.max(N-1, 1))<<2; H = M>>>1; st = new int[M]; pos = new int[M]; for(int i = 0;i < N;i++)pos[H+i] = i; Arrays.fill(st, 0, M, Integer.MAX_VALUE); for(int i = H-1;i >= 1;i--)propagate(i); } public SegmentTreeRMQPos(int[] a) { N = a.length; M = Integer.highestOneBit(Math.max(N-1, 1))<<2; H = M>>>1; st = new int[M]; pos = new int[M]; for(int i = 0;i < N;i++){ st[H+i] = a[i]; pos[H+i] = i; } Arrays.fill(st, H+N, M, Integer.MAX_VALUE); for(int i = H-1;i >= 1;i--)propagate(i); } public void update(int pos, int x) { st[H+pos] = x; for(int i = (H+pos)>>>1;i >= 1;i >>>= 1)propagate(i); } private void propagate(int i) { if(st[2*i] <= st[2*i+1]){ st[i] = st[2*i]; pos[i] = pos[2*i]; }else{ st[i] = st[2*i+1]; pos[i] = pos[2*i+1]; } } public int minpos; public int minval; public int minx(int l, int r){ minval = Integer.MAX_VALUE; minpos = -1; if(l >= r)return minval; while(l != 0){ int f = l&-l; if(l+f > r)break; int v = st[(H+l)/f]; if(v < minval){ minval = v; minpos = pos[(H+l)/f]; } l += f; } while(l < r){ int f = r&-r; int v = st[(H+r)/f-1]; if(v < minval){ minval = v; minpos = pos[(H+r)/f-1]; } r -= f; } return minval; } public int min(int l, int r){ minpos = -1; minval = Integer.MAX_VALUE; min(l, r, 0, H, 1); return minval; } private void min(int l, int r, int cl, int cr, int cur) { if(l <= cl && cr <= r){ if(st[cur] < minval){ minval = st[cur]; minpos = pos[cur]; } }else{ int mid = cl+cr>>>1; if(cl < r && l < mid)min(l, r, cl, mid, 2*cur); if(mid < r && l < cr)min(l, r, mid, cr, 2*cur+1); } } } 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"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new E().run(); } private byte[] inbuf = new byte[1024]; public 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))){ // when nextLine, (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 int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } 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[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } 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)); } }