結果

問題 No.489 株に挑戦
ユーザー ひばちひばち
提出日時 2020-01-11 17:48:59
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 142 ms / 1,000 ms
コード長 6,664 bytes
コンパイル時間 2,735 ms
コンパイル使用メモリ 112,824 KB
実行使用メモリ 31,924 KB
最終ジャッジ日時 2023-09-27 06:07:12
合計ジャッジ時間 7,934 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 122 ms
30,092 KB
testcase_01 AC 106 ms
29,044 KB
testcase_02 AC 69 ms
21,708 KB
testcase_03 AC 69 ms
21,812 KB
testcase_04 AC 66 ms
21,720 KB
testcase_05 AC 69 ms
19,772 KB
testcase_06 AC 70 ms
21,672 KB
testcase_07 AC 68 ms
21,760 KB
testcase_08 AC 69 ms
23,736 KB
testcase_09 AC 70 ms
19,636 KB
testcase_10 AC 69 ms
19,812 KB
testcase_11 AC 69 ms
19,724 KB
testcase_12 AC 69 ms
21,736 KB
testcase_13 AC 69 ms
23,856 KB
testcase_14 AC 69 ms
21,656 KB
testcase_15 AC 73 ms
23,996 KB
testcase_16 AC 130 ms
30,128 KB
testcase_17 AC 78 ms
24,008 KB
testcase_18 AC 103 ms
28,076 KB
testcase_19 AC 99 ms
28,776 KB
testcase_20 AC 133 ms
28,196 KB
testcase_21 AC 87 ms
28,832 KB
testcase_22 AC 75 ms
23,928 KB
testcase_23 AC 109 ms
28,104 KB
testcase_24 AC 142 ms
28,200 KB
testcase_25 AC 66 ms
21,608 KB
testcase_26 AC 138 ms
31,484 KB
testcase_27 AC 137 ms
28,360 KB
testcase_28 AC 68 ms
21,656 KB
testcase_29 AC 65 ms
19,520 KB
testcase_30 AC 142 ms
31,924 KB
testcase_31 AC 141 ms
31,784 KB
testcase_32 AC 107 ms
24,016 KB
testcase_33 AC 138 ms
28,100 KB
testcase_34 AC 128 ms
26,496 KB
testcase_35 AC 94 ms
24,276 KB
testcase_36 AC 80 ms
24,196 KB
testcase_37 AC 108 ms
29,928 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.Linq;
using System.IO;
using System.Runtime.CompilerServices;
using System.Text;
using static Template;
using static System.Console;
using static System.Convert;
using static System.Math;
using Pi = Pair<int, int>;

class Solver
{
    public void Solve(Scanner sc)
    {
        int N, D, K;
        sc.Make(out N, out D, out K);
        var max = 0L;
        int j = -1, k = -1;
        var X = sc.ArrInt1D(N);
        var aq = new AggregationQueue<int>(Max);
        for (var i = 1; i < D; i++)
            aq.Push(X[i]);
        for(var i = 0; i < N - 1; i++)
        {
            if (i + D < N) aq.Push(X[i+D]);
            if(chmax(ref max,aq.All_Fold()-X[i]))
            { j = i;k = aq.All_Fold(); }
            aq.Pop();
        }
        if (max == 0) Fail(0);
        for(var p=j+1;p<N;p++)
            if (k == X[p]) { k = p;break; }
        WriteLine(max * K);
        WriteLine($"{j} {k}");
    }
}

class AggregationQueue<T>
{
    private Stack<Node> front, back;
    private Func<T, T, T> f;//半群
    public AggregationQueue(Func<T, T, T> f)
    {
        this.f = f;
        front = new Stack<Node>();
        back = new Stack<Node>();
    }
    public int Count => front.Count + back.Count;
    public bool Any() => front.Count > 0 || back.Count > 0;
    public T All_Fold()
    {
        if (!front.Any())
            return back.Peek().sum;
        if (!back.Any())
            return front.Peek().sum;
        return f(front.Peek().sum, back.Peek().sum);
    }
    public void Push(T v)
    {
        if (back.Any())
            back.Push(new Node(v, f(back.Peek().sum, v)));
        else back.Push(new Node(v, v));
    }
    public void Pop()
    {
        if (!front.Any())
        {
            front.Push(new Node(back.Peek().val, back.Pop().val));
            while (back.Any())
            {
                var s = f(back.Peek().val, front.Peek().sum);
                front.Push(new Node(back.Pop().val, s));
            }
        }
        front.Pop();
    }
    private struct Node
    {
        public T val, sum;
        public Node(T v, T s) { val = v; sum = s; }
    }
}
#region Template
public static class Template
{
    static void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver().Solve(new Scanner());
        Console.Out.Flush();
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmin<T>(ref T a, T b) where T : IComparable<T>
    { if (a.CompareTo(b) == 1) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmax<T>(ref T a, T b) where T : IComparable<T>
    { if (a.CompareTo(b) == -1) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(ref T a, ref T b)
    { var t = b; b = a; a = t; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static T[] Create<T>(int n, Func<T> f)
    {
        var rt = new T[n];
        for (var i = 0; i < rt.Length; ++i)
            rt[i] = f();
        return rt;
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static T[] Create<T>(int n, Func<int, T> f)
    {
        var rt = new T[n];
        for (var i = 0; i < rt.Length; ++i)
            rt[i] = f(i);
        return rt;
    }
    public static T[] Copy<T>(this T[] A)
        => Create(A.Length, i => A[i]);
    public static void Fail<T>(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); }
}

public class Scanner
{
    public string Str => Console.ReadLine().Trim();
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public int[] ArrInt => Str.Split(' ').Select(int.Parse).ToArray();
    public long[] ArrLong => Str.Split(' ').Select(long.Parse).ToArray();
    public char[][] Grid(int n) => Create(n, () => Str.ToCharArray());
    public int[] ArrInt1D(int n) => Create(n, () => Int);
    public long[] ArrLong1D(int n) => Create(n, () => Long);
    public int[][] ArrInt2D(int n) => Create(n, () => ArrInt);
    public long[][] ArrLong2D(int n) => Create(n, () => ArrLong);
    public Pair<T1, T2> PairMake<T1, T2>() => new Pair<T1, T2>(Next<T1>(), Next<T2>());
    public Pair<T1, T2, T3> PairMake<T1, T2, T3>() => new Pair<T1, T2, T3>(Next<T1>(), Next<T2>(), Next<T3>());
    private Queue<string> q = new Queue<string>();
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public T Next<T>() { if (q.Count == 0) foreach (var item in Str.Split(' ')) q.Enqueue(item); return (T)Convert.ChangeType(q.Dequeue(), typeof(T)); }
    public void Make<T1>(out T1 v1) => v1 = Next<T1>();
    public void Make<T1, T2>(out T1 v1, out T2 v2) { v1 = Next<T1>(); v2 = Next<T2>(); }
    public void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next<T3>(); }
    public void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4) { Make(out v1, out v2, out v3); v4 = Next<T4>(); }
    public void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5) { Make(out v1, out v2, out v3, out v4); v5 = Next<T5>(); }
    public void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6) { Make(out v1, out v2, out v3, out v4, out v5); v6 = Next<T6>(); }
}

public class Pair<T1, T2> : IComparable<Pair<T1, T2>>
{
    public T1 v1;
    public T2 v2;
    public Pair() { }
    public Pair(T1 v1, T2 v2)
    { this.v1 = v1; this.v2 = v2; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2> p)
    {
        var c = Comparer<T1>.Default.Compare(v1, p.v1);
        if (c == 0)
            c = Comparer<T2>.Default.Compare(v2, p.v2);
        return c;
    }
    public override string ToString() => $"{v1.ToString()} {v2.ToString()}";
    public void Tie(out T1 a, out T2 b) { a = v1; b = v2; }
}

public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>>
{
    public T3 v3;
    public Pair() : base() { }
    public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2)
    { this.v3 = v3; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2, T3> p)
    {
        var c = base.CompareTo(p);
        if (c == 0)
            c = Comparer<T3>.Default.Compare(v3, p.v3);
        return c;
    }
    public override string ToString() => $"{base.ToString()} {v3.ToString()}";
    public void Tie(out T1 a, out T2 b, out T3 c) { Tie(out a, out b); c = v3; }
}
#endregion
0