結果

問題 No.999 てん vs. ほむ
ユーザー claw88claw88
提出日時 2020-02-28 21:30:31
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 4,017 bytes
コンパイル時間 2,844 ms
コンパイル使用メモリ 115,316 KB
実行使用メモリ 47,064 KB
最終ジャッジ日時 2024-04-21 17:53:41
合計ジャッジ時間 5,743 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 26 ms
23,948 KB
testcase_01 AC 27 ms
25,768 KB
testcase_02 AC 27 ms
25,908 KB
testcase_03 AC 26 ms
24,072 KB
testcase_04 AC 27 ms
23,948 KB
testcase_05 WA -
testcase_06 AC 29 ms
23,856 KB
testcase_07 AC 32 ms
24,400 KB
testcase_08 AC 38 ms
24,796 KB
testcase_09 AC 125 ms
47,064 KB
testcase_10 AC 57 ms
24,064 KB
testcase_11 AC 48 ms
22,144 KB
testcase_12 AC 66 ms
27,520 KB
testcase_13 AC 132 ms
42,496 KB
testcase_14 AC 131 ms
42,752 KB
testcase_15 AC 130 ms
42,880 KB
testcase_16 AC 131 ms
42,624 KB
testcase_17 AC 99 ms
37,760 KB
testcase_18 WA -
testcase_19 AC 101 ms
37,888 KB
testcase_20 WA -
testcase_21 AC 128 ms
42,496 KB
testcase_22 AC 131 ms
41,856 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 SB = System.Text.StringBuilder;
//using System.Threading.Tasks;
//using System.Text.RegularExpressions;
//using System.Globalization;
//using System.Diagnostics;
using static System.Console;
using System.Numerics;
using static System.Math;
using pair = Pair<int, int>;

class Program
{
    static void Main()
    {
        //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    readonly Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;
    readonly int dom = 998244353;
    bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (b.CompareTo(a) < 0) { a = b; return true; } return false; }

    void solve()
    {
        int N = cin.nextint;
        var A = cin.scanlong;

        var left = new long[2 * N];
        var right = new long[2 * N + 2];

        for (int i = 1; i < 2 * N; i += 2)
        {
            left[i] = A[i - 1] - A[i];
            if (i > 1) left[i] += left[i - 2];
        }
        for (int i = 2 * N - 1; i >= 0; i -= 2)
        {
            right[i] = A[i] - A[i - 1];
            if (i != 2 * N - 1) right[i] += right[i + 2];
        }
        //left.join();
        //right.join();


        long ans = 0;
        for (int i = 1; i < 2 * N; i += 2)
        {
            if (i == 1)
            {
                ans = right[i];
            }
            else
            {
                chmax(ref ans, left[i - 2] + right[i]);
            }
        }
        WriteLine(ans);
    }

}


static class Ex
{
    public static void join<T>(this IEnumerable<T> values, string sep = " ") => WriteLine(string.Join(sep, values));
    public static string concat<T>(this IEnumerable<T> values) => string.Concat(values);
    public static string reverse(this string s) { var t = s.ToCharArray(); Array.Reverse(t); return t.concat(); }

    public static int lower_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) < 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
    public static int upper_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) <= 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
}

class Pair<T, U> : IComparable<Pair<T, U>> where T : IComparable<T> where U : IComparable<U>
{
    public T f; public U s;
    public Pair(T f, U s) { this.f = f; this.s = s; }
    public int CompareTo(Pair<T, U> a) => f.CompareTo(a.f) != 0 ? f.CompareTo(a.f) : s.CompareTo(a.s);
    public override string ToString() => $"{f} {s}";
}

class Scanner
{
    string[] s; int i;
    readonly char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan => ReadLine().Split();
    public int[] scanint => Array.ConvertAll(scan, int.Parse);
    public long[] scanlong => Array.ConvertAll(scan, long.Parse);
    public double[] scandouble => 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 => int.Parse(next);
    public long nextlong => long.Parse(next);
    public double nextdouble => double.Parse(next);
}
0