結果
問題 | No.489 株に挑戦 |
ユーザー |
|
提出日時 | 2017-03-25 19:07:01 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 288 ms / 1,000 ms |
コード長 | 2,422 bytes |
コンパイル時間 | 2,754 ms |
コンパイル使用メモリ | 78,116 KB |
実行使用メモリ | 47,892 KB |
最終ジャッジ日時 | 2024-07-19 23:45:27 |
合計ジャッジ時間 | 11,357 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 35 |
ソースコード
import java.io.OutputStream;import java.io.IOException;import java.io.InputStream;import java.io.PrintWriter;import java.util.StringTokenizer;import java.io.IOException;import java.io.BufferedReader;import java.io.InputStreamReader;import java.io.InputStream;/*** Built using CHelper plug-in* Actual solution is at the top** @author Chiaki.Hoshinomori*/public class Main {public static void main(String[] args) {InputStream inputStream = System.in;OutputStream outputStream = System.out;InputReader in = new InputReader(inputStream);PrintWriter out = new PrintWriter(outputStream);Task489 solver = new Task489();solver.solve(1, in, out);out.close();}static class Task489 {public void solve(int testNumber, InputReader in, PrintWriter out) {int n = in.nextInt();int d = in.nextInt();int k = in.nextInt();int[] x = new int[n];for (int i = 0; i < n; i++) {x[i] = in.nextInt();}int[] q = new int[n];int h = 0, t = -1;int ret = 0, a = 0, b = 0;for (int i = 0; i < n; i++) {while (h <= t && q[h] < i - d) ++h;if (h <= t && x[i] - x[q[h]] > ret) {ret = x[i] - x[q[h]];a = q[h];b = i;}while (h <= t && x[q[t]] > x[i]) --t;q[++t] = i;}if (ret == 0) out.println(ret);else out.printf("%d\n%d %d\n", (long) k * ret, a, b);}}static class InputReader {public BufferedReader reader;public StringTokenizer tokenizer;public InputReader(InputStream stream) {reader = new BufferedReader(new InputStreamReader(stream), 32768);tokenizer = null;}public String next() {while (tokenizer == null || !tokenizer.hasMoreTokens()) {try {tokenizer = new StringTokenizer(reader.readLine());} catch (IOException e) {throw new RuntimeException(e);}}return tokenizer.nextToken();}public int nextInt() {return Integer.parseInt(next());}}}