結果
問題 | No.489 株に挑戦 |
ユーザー |
![]() |
提出日時 | 2017-05-20 11:13:19 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 36 ms / 1,000 ms |
コード長 | 8,031 bytes |
コンパイル時間 | 2,783 ms |
コンパイル使用メモリ | 118,260 KB |
実行使用メモリ | 18,176 KB |
最終ジャッジ日時 | 2024-07-19 23:50:42 |
合計ジャッジ時間 | 3,075 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 35 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;using System.Linq;using System.Collections.Generic;using Debug = System.Diagnostics.Debug;using SB = System.Text.StringBuilder;using Number = System.Int64;using System.Numerics;using static System.Math;//using static MathEx;namespace Program{public class Solver{public void Solve(){var n = ri;var d = ri;var k = ri;var a = Enumerate(n, x => ri);var deq = new Deque<int>();var ans = 0;var f = -1; var t = -1;for (int i = 0; i < n; i++){while (deq.Count > 0 && i - deq[0] > d) deq.PopFront();while (deq.Count > 0 && a[deq[deq.Count - 1]] > a[i]) deq.PopBack();deq.PushBack(i);var min = deq[0];if (a[i] - a[min] > ans){ans = a[i] - a[min];f = min; t = i;}}IO.Printer.Out.WriteLine(1L * k * ans);if (f != -1) IO.Printer.Out.WriteLine("{0} {1}", f, t);}int ri => sc.Integer();long rl => sc.Long();double rd => sc.Double();string rs => sc.Scan();char rc => sc.Char();[System.Diagnostics.Conditional("DEBUG")]void put(params object[] a) => Debug.WriteLine(string.Join(" ", a));public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }}}#region mainstatic class Ex{static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); }static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }static public void Main(){var solver = new Program.Solver();solver.Solve();Program.IO.Printer.Out.Flush();}}#endregion#region Exnamespace Program.IO{using System.IO;using System.Text;using System.Globalization;public class Printer: StreamWriter{static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; }public static Printer Out { get; set; }public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { }public void Write<T>(string format, T[] source) { base.Write(format, source.OfType<object>().ToArray()); }public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().ToArray()); }}public class StreamScanner{public StreamScanner(Stream stream) { str = stream; }public readonly Stream str;private readonly byte[] buf = new byte[1024];private int len, ptr;public bool isEof = false;public bool IsEndOfStream { get { return isEof; } }private byte read(){if (isEof) return 0;if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }return buf[ptr++];}public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; }public string Scan(){var sb = new StringBuilder();for (var b = Char(); b >= 33 && b <= 126; b = (char)read())sb.Append(b);return sb.ToString();}public string ScanLine(){var sb = new StringBuilder();for (var b = Char(); b != '\n'; b = (char)read())if (b == 0) break;else if (b != '\r') sb.Append(b);return sb.ToString();}public long Long(){if (isEof) return long.MinValue;long ret = 0; byte b = 0; var ng = false;do b = read();while (b != 0 && b != '-' && (b < '0' || '9' < b));if (b == 0) return long.MinValue;if (b == '-') { ng = true; b = read(); }for (; true; b = read()){if (b < '0' || '9' < b)return ng ? -ret : ret;else ret = ret * 10 + b - '0';}}public int Integer() { return (isEof) ? int.MinValue : (int)Long(); }public double Double() { var s = Scan(); return s != "" ? double.Parse(s, CultureInfo.InvariantCulture) : double.NaN; }private T[] enumerate<T>(int n, Func<T> f){var a = new T[n];for (int i = 0; i < n; ++i) a[i] = f();return a;}public char[] Char(int n) { return enumerate(n, Char); }public string[] Scan(int n) { return enumerate(n, Scan); }public double[] Double(int n) { return enumerate(n, Double); }public int[] Integer(int n) { return enumerate(n, Integer); }public long[] Long(int n) { return enumerate(n, Long); }}}#endregion#region Deque<T>public class Deque<T>{T[] buf;int offset;int count;int capacity;public int Count { get { return count; } }public Deque(int cap) { buf = new T[capacity = cap]; }public Deque() { buf = new T[capacity = 8]; }public T this[int index]{get { return buf[getIndex(index)]; }set { buf[getIndex(index)] = value; }}private int getIndex(int index){if (index >= capacity)throw new IndexOutOfRangeException("out of range");var ret = index + offset;if (ret >= capacity)ret -= capacity;return ret;}public void PushFront(T item){if (count == capacity) Extend();if (--offset < 0) offset += buf.Length;buf[offset] = item;++count;}public T PopFront(){if (count == 0)throw new InvalidOperationException("collection is empty");--count;var ret = buf[offset++];if (offset >= capacity) offset -= capacity;return ret;}public void PushBack(T item){if (count == capacity) Extend();var id = count++ + offset;if (id >= capacity) id -= capacity;buf[id] = item;}public T PopBack(){if (count == 0)throw new InvalidOperationException("collection is empty");return buf[getIndex(--count)];}public void Insert(T item, int index){if (index > count) throw new IndexOutOfRangeException();this.PushFront(item);for (int i = 0; i < index; i++)this[i] = this[i + 1];this[index] = item;}public T RemoveAt(int index){if (index < 0 || index >= count) throw new IndexOutOfRangeException();var ret = this[index];for (int i = index; i > 0; i--)this[i] = this[i - 1];this.PopFront();return ret;}private void Extend(){T[] newBuffer = new T[capacity << 1];if (offset > capacity - count){var len = buf.Length - offset;Array.Copy(buf, offset, newBuffer, 0, len);Array.Copy(buf, 0, newBuffer, len, count - len);}else Array.Copy(buf, offset, newBuffer, 0, count);buf = newBuffer;offset = 0;capacity <<= 1;}public T[] Items{get{var a = new T[count];for (int i = 0; i < count; i++)a[i] = this[i];return a;}}}#endregion