結果

問題 No.921 ずんだアロー
ユーザー EmKjpEmKjp
提出日時 2019-11-08 21:33:08
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 4,921 bytes
コンパイル時間 3,469 ms
コンパイル使用メモリ 112,924 KB
実行使用メモリ 32,464 KB
最終ジャッジ日時 2023-10-13 03:34:29
合計ジャッジ時間 6,076 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 61 ms
21,500 KB
testcase_01 AC 61 ms
21,484 KB
testcase_02 AC 60 ms
21,524 KB
testcase_03 AC 60 ms
23,420 KB
testcase_04 AC 61 ms
21,520 KB
testcase_05 AC 60 ms
21,516 KB
testcase_06 AC 68 ms
21,520 KB
testcase_07 AC 68 ms
21,532 KB
testcase_08 AC 60 ms
19,560 KB
testcase_09 AC 61 ms
21,468 KB
testcase_10 AC 100 ms
30,844 KB
testcase_11 AC 101 ms
29,148 KB
testcase_12 AC 76 ms
25,044 KB
testcase_13 AC 94 ms
29,760 KB
testcase_14 AC 97 ms
32,320 KB
testcase_15 AC 86 ms
27,340 KB
testcase_16 AC 72 ms
22,060 KB
testcase_17 AC 97 ms
32,464 KB
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 AC 102 ms
31,356 KB
testcase_24 AC 97 ms
31,604 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;
using System.Collections.Generic;
using System.Globalization;
using System.IO;
using System.Linq;

using E = System.Linq.Enumerable;

internal partial class Solver {
    public void Run() {
        var n = ni();
        var a = ni(n);
        var c = Compress(a);
        var dp = new int[c.Length];
        dp[0] = c[0];

        for (int i = 1; i < c.Length; i++) {
            dp[i] = dp[i - 1];
            dp[i] = Math.Max(dp[i], ((i - 2 >= 0) ? dp[i - 2] : 0) + c[i]);
        }
        cout.WriteLine(dp.Max());
    }

    static private int[] Compress(int[] a) {
        int cnt = 0;
        int last = -1;
        var r = new List<int>();
        foreach (var x in a) {
            if (last != x) {
                if (cnt > 0) r.Add(cnt);
                cnt = 1;
            } else {
                cnt++;
            }
            last = x;
        }
        if (cnt > 0) r.Add(cnt);
        return r.ToArray();
    }
}

// PREWRITEN CODE BEGINS FROM HERE
internal partial class Solver : Scanner {
    public static void Main(string[] args) {
#if LOCAL
        byte[] inputBuffer = new byte[1000000];
        var inputStream = Console.OpenStandardInput(inputBuffer.Length);
        Console.SetIn(new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length));
        new Solver(Console.In, Console.Out).Run();
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

internal static class LinqPadExtension {
    public static T Dump<T>(this T obj) {
#if LOCAL
        return LINQPad.Extensions.Dump(obj);
#else
        return obj;
#endif
    }
}

public class Scanner {
    private readonly TextReader Reader;
    private readonly Queue<string> TokenQueue = new Queue<string>();
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        Reader = reader;
    }

    public int NextInt() { return int.Parse(Next(), ci); }
    public long NextLong() { return long.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        string[] array = new string[size];
        for (int i = 0; i < size; i++) {
            array[i] = Next();
        }

        return array;
    }
    public int[] NextIntArray(int size) {
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextInt();
        }

        return array;
    }

    public long[] NextLongArray(int size) {
        long[] array = new long[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextLong();
        }

        return array;
    }

    public double[] NextDoubleArray(int size) {
        double[] array = new double[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextDouble();
        }

        return array;
    }

    public string Next() {
        if (TokenQueue.Count == 0) {
            if (!StockTokens()) {
                throw new InvalidOperationException();
            }
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext() {
        if (TokenQueue.Count > 0) {
            return true;
        }

        return StockTokens();
    }

    private static readonly char[] _separator = new[] { ' ', '\t' };
    private bool StockTokens() {
        while (true) {
            string line = Reader.ReadLine();
            if (line == null) {
                return false;
            }

            string[] tokens = line.Split(_separator, StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) {
                continue;
            }

            foreach (string token in tokens) {
                TokenQueue.Enqueue(token);
            }

            return true;
        }
    }
}
0