結果
問題 | No.489 株に挑戦 |
ユーザー | claw88 |
提出日時 | 2017-02-27 16:35:50 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,755 bytes |
コンパイル時間 | 2,424 ms |
コンパイル使用メモリ | 106,304 KB |
実行使用メモリ | 30,252 KB |
最終ジャッジ日時 | 2023-09-22 20:00:53 |
合計ジャッジ時間 | 6,957 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 101 ms
30,212 KB |
testcase_01 | AC | 89 ms
26,188 KB |
testcase_02 | AC | 66 ms
24,240 KB |
testcase_03 | AC | 66 ms
24,212 KB |
testcase_04 | AC | 62 ms
21,996 KB |
testcase_05 | AC | 66 ms
24,120 KB |
testcase_06 | AC | 66 ms
24,196 KB |
testcase_07 | AC | 65 ms
24,228 KB |
testcase_08 | AC | 66 ms
26,260 KB |
testcase_09 | AC | 66 ms
24,120 KB |
testcase_10 | AC | 65 ms
22,312 KB |
testcase_11 | AC | 65 ms
26,164 KB |
testcase_12 | AC | 65 ms
26,104 KB |
testcase_13 | AC | 67 ms
24,204 KB |
testcase_14 | AC | 65 ms
24,232 KB |
testcase_15 | AC | 68 ms
24,100 KB |
testcase_16 | AC | 106 ms
28,228 KB |
testcase_17 | AC | 72 ms
26,280 KB |
testcase_18 | AC | 88 ms
26,248 KB |
testcase_19 | AC | 83 ms
26,008 KB |
testcase_20 | AC | 106 ms
28,152 KB |
testcase_21 | AC | 76 ms
24,284 KB |
testcase_22 | AC | 69 ms
24,284 KB |
testcase_23 | AC | 91 ms
28,140 KB |
testcase_24 | AC | 113 ms
28,128 KB |
testcase_25 | AC | 62 ms
24,140 KB |
testcase_26 | AC | 112 ms
28,316 KB |
testcase_27 | AC | 110 ms
28,256 KB |
testcase_28 | AC | 65 ms
24,160 KB |
testcase_29 | AC | 61 ms
24,044 KB |
testcase_30 | AC | 117 ms
26,264 KB |
testcase_31 | AC | 111 ms
30,204 KB |
testcase_32 | AC | 92 ms
28,248 KB |
testcase_33 | AC | 113 ms
28,404 KB |
testcase_34 | AC | 104 ms
30,244 KB |
testcase_35 | AC | 81 ms
26,176 KB |
testcase_36 | AC | 72 ms
22,240 KB |
testcase_37 | WA | - |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.Collections.Generic; using System.Linq; using System.IO; using System.Globalization; using System.Diagnostics; using static System.Console; using Pair = System.Collections.Generic.KeyValuePair<int, int>; class Program { static void Main() { SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false }); new Program().Solve(); Out.Flush(); } Scanner cin = new Scanner(); Random rnd = new Random(); Stopwatch sw = new Stopwatch(); readonly int[] dd = { 0, 1, 0, -1, 0 }; readonly int mod = 1000000007; readonly string alfa = "abcdefghijklmnopqrstuvwxyz"; int N, D, K; void Solve() { N = cin.Nextint; D = cin.Nextint; K = cin.Nextint; long MAX = 0; int l = 0; int ans1 = 0, ans2 = 0; bool flag = false; var X = new int[N]; for (int i = 0; i < N; i++) { X[i] = cin.Nextint; } int high = X[0]; int low = X[0]; for (int i = 1; i < N; i++) { if (X[i] <= low) { l = i; low = X[i]; high = X[i]; } high = Math.Max(high, X[i]); if (MAX < high - low) { MAX = high - low; ans1 = l; ans2 = i; flag = true; } if (D < i + 1 - l) { low = int.MaxValue; for (int j = l + 1; j <= i; j++) { if (X[j] < low) { l = j; low = X[j]; } } } } WriteLine(flag ? $"{K * MAX}\n{ans1} {ans2}" : "0"); } } class Scanner { string[] s; int i; char[] cs = new char[] { ' ' }; public Scanner() { s = new string[0]; i = 0; } public string[] Scan { get { return ReadLine().Split(); } } public int[] Scanint { get { return Array.ConvertAll(Scan, int.Parse); } } public long[] Scanlong { get { return Array.ConvertAll(Scan, long.Parse); } } public double[] Scandouble { get { return Array.ConvertAll(Scan, double.Parse); } } public string Next { get { if (i < s.Length) return s[i++]; string st = ReadLine(); while (st == "") st = ReadLine(); s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries); i = 0; return Next; } } public int Nextint { get { return int.Parse(Next); } } public long Nextlong { get { return long.Parse(Next); } } public double Nextdouble { get { return double.Parse(Next); } } }