結果

問題 No.489 株に挑戦
ユーザー くれちーくれちー
提出日時 2017-07-30 18:10:28
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 136 ms / 1,000 ms
コード長 3,833 bytes
コンパイル時間 2,550 ms
コンパイル使用メモリ 112,620 KB
実行使用メモリ 35,412 KB
最終ジャッジ日時 2023-09-27 05:49:19
合計ジャッジ時間 7,931 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 121 ms
29,944 KB
testcase_01 AC 107 ms
26,376 KB
testcase_02 AC 71 ms
21,776 KB
testcase_03 AC 71 ms
21,760 KB
testcase_04 AC 69 ms
21,888 KB
testcase_05 AC 70 ms
23,828 KB
testcase_06 AC 71 ms
21,752 KB
testcase_07 AC 71 ms
21,752 KB
testcase_08 AC 70 ms
21,916 KB
testcase_09 AC 72 ms
22,008 KB
testcase_10 AC 71 ms
21,900 KB
testcase_11 AC 70 ms
21,728 KB
testcase_12 AC 70 ms
21,760 KB
testcase_13 AC 70 ms
23,784 KB
testcase_14 AC 70 ms
21,824 KB
testcase_15 AC 81 ms
22,708 KB
testcase_16 AC 124 ms
34,080 KB
testcase_17 AC 84 ms
22,832 KB
testcase_18 AC 104 ms
28,024 KB
testcase_19 AC 99 ms
25,412 KB
testcase_20 AC 132 ms
34,836 KB
testcase_21 AC 92 ms
25,816 KB
testcase_22 AC 83 ms
22,840 KB
testcase_23 AC 103 ms
28,468 KB
testcase_24 AC 135 ms
33,228 KB
testcase_25 AC 69 ms
21,740 KB
testcase_26 AC 132 ms
35,412 KB
testcase_27 AC 135 ms
34,896 KB
testcase_28 AC 69 ms
19,964 KB
testcase_29 AC 67 ms
23,828 KB
testcase_30 AC 136 ms
33,428 KB
testcase_31 AC 133 ms
33,200 KB
testcase_32 AC 109 ms
28,820 KB
testcase_33 AC 135 ms
33,076 KB
testcase_34 AC 126 ms
32,192 KB
testcase_35 AC 98 ms
25,464 KB
testcase_36 AC 87 ms
23,044 KB
testcase_37 AC 109 ms
30,776 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Text;
using static System.Console;
using static System.Convert;
using static System.Math;
using static Extentions;

class IO
{
    int idx;
    string[] input;

    public IO(TextReader reader)
    {
        input = reader.ReadToEnd().Split(new[] { " ", "\n", "\r" },
            StringSplitOptions.RemoveEmptyEntries);
    }

    T Get<T>(Func<string, T> parser) => parser(input[idx++]);

    public string S => Get(s => s);
    public char C => Get(char.Parse);
    public int I => Get(int.Parse);
    public long L => Get(long.Parse);
    public double F => Get(double.Parse);
    public decimal D => Get(decimal.Parse);
    public BigInteger B => Get(BigInteger.Parse);

    T[] Gets<T>(int n, Func<string, T> parser)
        => input.Skip((idx += n) - n).Take(n).Select(parser).ToArray();

    public string[] Ss(int n) => Gets(n, s => s);
    public char[] Cs(int n) => Gets(n, char.Parse);
    public int[] Is(int n) => Gets(n, int.Parse);
    public long[] Ls(int n) => Gets(n, long.Parse);
    public double[] Fs(int n) => Gets(n, double.Parse);
    public decimal[] Ds(int n) => Gets(n, decimal.Parse);
    public BigInteger[] Bs(int n) => Gets(n, BigInteger.Parse);

    public void Write<T>(params T[] xs) => WriteLine(string.Join(" ", xs));
    public void Write(params object[] xs) => WriteLine(string.Join(" ", xs));
}

class SegmentTree<T>
{
    int n;
    T[] tree;
    T id;
    Func<T, T, T> ope;

    public SegmentTree(int n, T id, Func<T, T, T> ope) : this(id, ope)
    {
        this.n = 1;
        while (this.n < n) this.n *= 2;
        tree = Enumerable.Repeat(id, this.n * 2).ToArray();
    }

    public SegmentTree(T[] xs, T id, Func<T, T, T> ope) : this(id, ope)
    {
        n = 1;
        while (n < xs.Length) n *= 2;
        tree = new T[n * 2];
        for (var i = 0; i < n; i++)
            tree[i + n] = i < xs.Length ? xs[i] : id;
        for (var i = n - 1; i > 0; i--)
            tree[i] = ope(tree[i * 2], tree[i * 2 + 1]);
    }

    SegmentTree(T id, Func<T, T, T> ope)
    {
        this.id = id;
        this.ope = ope;
    }

    public T this[int i]
    {
        get { return tree[i + n]; }
        set
        {
            tree[i += n] = value;
            for (i >>= 1; i > 0; i >>= 1)
                tree[i] = ope(tree[i * 2], tree[i * 2 + 1]);
        }
    }

    public T this[int i, int j]
    {
        get
        {
            var r = id;
            i += n;
            j += n + 1;
            for (; i < j; i >>= 1, j >>= 1)
            {
                if ((j & 1) != 0) r = ope(r, tree[--j]);
                if ((i & 1) != 0) r = ope(r, tree[i++]);
            }
            return r;
        }
    }
}

static class Extentions
{
}

static class Program
{
    public static void Main()
    {
        var sw = new StreamWriter(OpenStandardOutput()) { NewLine = "\n" };
#if DEBUG
        sw.AutoFlush = true;
#else
        sw.AutoFlush = false;
#endif
        SetOut(sw);
        Solve(new IO(In));
        Out.Flush();
    }

    static void Solve(IO io)
    {
        var n = io.I;
        var d = io.I;
        var k = io.L;
        var x = io.Ls(n);

        var st = new SegmentTree<long>(x, 0, Max);

        var max = 0L;
        var maxi = 0;

        for (var i = 0; i < n; i++)
        {
            var t = st[i, Min(n - 1, i + d)];

            if (t - x[i] > max)
            {
                max = t - x[i];
                maxi = i;
            }
        }

        var p = maxi;
        var q = maxi + Array.FindIndex(x.Skip(maxi).ToArray(),
            a => a == max + x[maxi]);
        max *= k;

        if (max <= 0) io.Write(0);
        else
        {
            io.Write(max);
            io.Write(p, q);
        }
    }
}
0