結果
問題 | No.489 株に挑戦 |
ユーザー | Grenache |
提出日時 | 2017-02-24 22:59:44 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 294 ms / 1,000 ms |
コード長 | 4,797 bytes |
コンパイル時間 | 3,344 ms |
コンパイル使用メモリ | 77,136 KB |
実行使用メモリ | 61,688 KB |
最終ジャッジ日時 | 2023-09-27 05:05:16 |
合計ジャッジ時間 | 10,783 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 213 ms
59,084 KB |
testcase_01 | AC | 187 ms
58,744 KB |
testcase_02 | AC | 102 ms
53,828 KB |
testcase_03 | AC | 99 ms
55,612 KB |
testcase_04 | AC | 39 ms
49,800 KB |
testcase_05 | AC | 102 ms
56,220 KB |
testcase_06 | AC | 103 ms
56,052 KB |
testcase_07 | AC | 103 ms
55,680 KB |
testcase_08 | AC | 99 ms
55,704 KB |
testcase_09 | AC | 102 ms
55,676 KB |
testcase_10 | AC | 107 ms
55,744 KB |
testcase_11 | AC | 107 ms
55,820 KB |
testcase_12 | AC | 102 ms
55,692 KB |
testcase_13 | AC | 103 ms
56,084 KB |
testcase_14 | AC | 107 ms
55,660 KB |
testcase_15 | AC | 134 ms
55,512 KB |
testcase_16 | AC | 223 ms
61,268 KB |
testcase_17 | AC | 164 ms
56,024 KB |
testcase_18 | AC | 186 ms
58,752 KB |
testcase_19 | AC | 164 ms
58,224 KB |
testcase_20 | AC | 213 ms
60,988 KB |
testcase_21 | AC | 154 ms
55,988 KB |
testcase_22 | AC | 142 ms
56,136 KB |
testcase_23 | AC | 196 ms
58,416 KB |
testcase_24 | AC | 223 ms
60,632 KB |
testcase_25 | AC | 42 ms
49,540 KB |
testcase_26 | AC | 166 ms
58,048 KB |
testcase_27 | AC | 294 ms
58,456 KB |
testcase_28 | AC | 103 ms
55,636 KB |
testcase_29 | AC | 38 ms
49,504 KB |
testcase_30 | AC | 221 ms
60,988 KB |
testcase_31 | AC | 225 ms
60,796 KB |
testcase_32 | AC | 198 ms
58,256 KB |
testcase_33 | AC | 216 ms
61,688 KB |
testcase_34 | AC | 217 ms
61,116 KB |
testcase_35 | AC | 176 ms
58,436 KB |
testcase_36 | AC | 164 ms
56,144 KB |
testcase_37 | AC | 198 ms
58,508 KB |
ソースコード
import java.io.*; import java.util.*; public class Main_yukicoder489 { private static Scanner sc; private static Printer pr; private static void solve() { int n = sc.nextInt(); int d = sc.nextInt(); int k = sc.nextInt(); int[] x = new int[n]; for (int i = 0; i < n; i++) { x[i] = sc.nextInt(); } PriorityQueue<Pair> pq = new PriorityQueue<>(); pq.add(new Pair(x[0], 0)); long max = 0; int ansj = 0; int ansk = 0; for (int i = 1; i < n; i++) { Pair e = pq.peek(); while (i - e.b > d) { pq.remove(); e = pq.peek(); } int tmp = x[i] - e.a; if (tmp > max) { max = tmp; ansj = e.b; ansk = i; } pq.add(new Pair(x[i], i)); } if (max == 0) { pr.println(0); } else { pr.println(max * k); pr.printf("%d %d\n", ansj, ansk); } } private static class Pair implements Comparable<Pair> { int a; int b; Pair(int a, int b) { this.a = a; this.b = b; } @Override public int compareTo(Pair o) { if (a == o.a) { return Integer.compare(b, o.b); } return Integer.compare(a, o.a); } } // --------------------------------------------------- public static void main(String[] args) { sc = new Scanner(System.in); pr = new Printer(System.out); solve(); pr.close(); sc.close(); } @SuppressWarnings("unused") private static class Scanner { BufferedReader br; Scanner (InputStream in) { br = new BufferedReader(new InputStreamReader(in)); } private boolean isPrintable(int ch) { return ch >= '!' && ch <= '~'; } private boolean isCRLF(int ch) { return ch == '\n' || ch == '\r' || ch == -1; } private int nextPrintable() { try { int ch; while (!isPrintable(ch = br.read())) { if (ch == -1) { throw new NoSuchElementException(); } } return ch; } catch (IOException e) { throw new NoSuchElementException(); } } String next() { try { int ch = nextPrintable(); StringBuilder sb = new StringBuilder(); do { sb.appendCodePoint(ch); } while (isPrintable(ch = br.read())); return sb.toString(); } catch (IOException e) { throw new NoSuchElementException(); } } int nextInt() { try { // parseInt from Integer.parseInt() boolean negative = false; int res = 0; int limit = -Integer.MAX_VALUE; int radix = 10; int fc = nextPrintable(); if (fc < '0') { if (fc == '-') { negative = true; limit = Integer.MIN_VALUE; } else if (fc != '+') { throw new NumberFormatException(); } fc = br.read(); } int multmin = limit / radix; int ch = fc; do { int digit = ch - '0'; if (digit < 0 || digit >= radix) { throw new NumberFormatException(); } if (res < multmin) { throw new NumberFormatException(); } res *= radix; if (res < limit + digit) { throw new NumberFormatException(); } res -= digit; } while (isPrintable(ch = br.read())); return negative ? res : -res; } catch (IOException e) { throw new NoSuchElementException(); } } long nextLong() { try { // parseLong from Long.parseLong() boolean negative = false; long res = 0; long limit = -Long.MAX_VALUE; int radix = 10; int fc = nextPrintable(); if (fc < '0') { if (fc == '-') { negative = true; limit = Long.MIN_VALUE; } else if (fc != '+') { throw new NumberFormatException(); } fc = br.read(); } long multmin = limit / radix; int ch = fc; do { int digit = ch - '0'; if (digit < 0 || digit >= radix) { throw new NumberFormatException(); } if (res < multmin) { throw new NumberFormatException(); } res *= radix; if (res < limit + digit) { throw new NumberFormatException(); } res -= digit; } while (isPrintable(ch = br.read())); return negative ? res : -res; } catch (IOException e) { throw new NoSuchElementException(); } } float nextFloat() { return Float.parseFloat(next()); } double nextDouble() { return Double.parseDouble(next()); } String nextLine() { try { int ch; while (isCRLF(ch = br.read())) { if (ch == -1) { throw new NoSuchElementException(); } } StringBuilder sb = new StringBuilder(); do { sb.appendCodePoint(ch); } while (!isCRLF(ch = br.read())); return sb.toString(); } catch (IOException e) { throw new NoSuchElementException(); } } void close() { try { br.close(); } catch (IOException e) { // throw new NoSuchElementException(); } } } private static class Printer extends PrintWriter { Printer(PrintStream out) { super(out); } } }