#27171 (C#(csc)) No.209 Longest Mountain Subsequence

• 問題: No.209 Longest Mountain Subsequence
• ユーザー: 紙ぺーぱー
• 提出日時: 2015-05-15 23:13:02
• 言語: C#(csc) (csc 3.9.0)
• 結果: WA
• 実行時間: -
• コード長: 5,737 bytes
• コンパイル時間: 870 ms
• コンパイル使用メモリ: 120,684 KB
• 実行使用メモリ: 31,964 KB
• 最終ジャッジ日時: 2024-07-06 04:14:33
• 合計ジャッジ時間: 1,528 ms
• ジャッジサーバーID （参考情報）: judge3 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	WA	-
testcase_01	WA	-
testcase_02	WA	-
testcase_03	WA	-
testcase_04	WA	-
testcase_05	AC	32 ms; 21,632 KB

コンパイルメッセージ

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 StringBuilder = System.Text.StringBuilder;
using System.Numerics;
namespace Program
{

    public class Solver
    {
        public void Solve()
        {
            var T = sc.Integer();
            for (int i = 0; i < T; i++)
            {
                var n = sc.Integer();
                var a = sc.Long(n);
                var max = 0;

                for (int j = 0; j < n; j++)
                {
                    var b = Enumerate(n + 5, x => 1L << 50);
                    var c = Enumerate(n + 5, x => 1L << 50);
                    var l = 0;
                    var r = 0;
                    for (int k = 0; k <= j; k++)
                    {
                        var p = b.binarySearch(a[k]);
                        if (p == 0)
                            b[p] = a[k];
                        else
                        {
                            b[p] = Math.Max(a[k], b[p - 1] + p + 1);
                        }
                        if (k == j)
                            l = p + 1;
                    }
                    for (int k = n - 1; k >= j; k--)
                    {
                        var p = c.binarySearch(a[k]);
                        if (p == 0)
                            c[p] = a[k];
                        else
                            c[p] = Math.Max(a[k], c[p - 1] + p + 1);
                        if (k == j)
                            r = p + 1;
                    }
                    max = Math.Max(l + r - 1, max);
                }
                IO.Printer.Out.WriteLine(max);
            }
        }

        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 Ex
namespace 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, IEnumerable<T> source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, IEnumerable<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 long Long()
        {
            if (isEof) return long.MinValue;
            long ret = 0; byte b = 0; var ng = false;
            do b = read();
            while (b != '-' && (b < '0' || '9' < b));
            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() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
        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); }
    }
}
static 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 BinarySearch for Array
static public partial class Algorithm
{

    static public int binarySearch(this long[] a, long v)
    {
        int l = 0;
        int h = a.Length - 1;
        while (l <= h)
        {
            int m = ((h + l) >> 1);

            if (a[m] < v)//lower_bound
                l = m + 1;
            else h = m - 1;
        }

        return l;
    }

}
#endregion