結果

問題 No.284 門松と魔法(2)
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2015-07-12 20:36:19
言語 C#(csc)
(csc 3.9.0)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 5,466 bytes
コンパイル時間 853 ms
コンパイル使用メモリ 117,400 KB
実行使用メモリ 31,876 KB
最終ジャッジ日時 2024-07-08 05:57:21
合計ジャッジ時間 8,425 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 26 ms
24,756 KB
testcase_01 AC 26 ms
22,836 KB
testcase_02 AC 28 ms
24,928 KB
testcase_03 AC 27 ms
26,916 KB
testcase_04 AC 27 ms
25,256 KB
testcase_05 AC 26 ms
24,756 KB
testcase_06 AC 26 ms
26,912 KB
testcase_07 AC 25 ms
25,008 KB
testcase_08 AC 26 ms
27,096 KB
testcase_09 AC 25 ms
24,628 KB
testcase_10 AC 67 ms
23,092 KB
testcase_11 AC 29 ms
22,836 KB
testcase_12 AC 52 ms
25,140 KB
testcase_13 AC 26 ms
25,060 KB
testcase_14 AC 28 ms
24,988 KB
testcase_15 AC 27 ms
22,712 KB
testcase_16 AC 30 ms
25,008 KB
testcase_17 AC 27 ms
24,880 KB
testcase_18 AC 26 ms
24,880 KB
testcase_19 AC 26 ms
24,876 KB
testcase_20 AC 27 ms
26,952 KB
testcase_21 AC 32 ms
25,012 KB
testcase_22 AC 168 ms
22,904 KB
testcase_23 TLE -
testcase_24 -- -
testcase_25 -- -
testcase_26 -- -
testcase_27 -- -
testcase_28 -- -
testcase_29 -- -
testcase_30 -- -
testcase_31 -- -
testcase_32 -- -
testcase_33 -- -
testcase_34 -- -
testcase_35 -- -
testcase_36 -- -
testcase_37 -- -
testcase_38 -- -
testcase_39 -- -
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.Linq;
using System.Diagnostics;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;

namespace Program
{

    public class Solver
    {
        /// <summary>
        /// O(N^3) Naive TLE
        /// </summary>
        public void Solve()
        {
            var n = sc.Integer();
            var a = sc.Integer(n);
            var S = a.Distinct().ToList();
            S.Add(-1); S.Add(int.MaxValue);
            S.Sort();
            for (int i = 0; i < n; i++)
                a[i] = S.BinarySearch(a[i]);
            var sz = S.Count;
            var dp = new int[sz, sz];
            for (int i = 0; i < sz; i++)
                for (int j = 0; j < sz; j++)
                    dp[i, j] = -10000000;
            dp[0, sz - 1] = dp[sz - 1, 0] = 0;
            foreach (var i in a)
            {
                for (int j = 0; j < sz; j++)
                    for (int k = 0; k < sz; k++)
                    {
                        if (j == i || k == i)
                            continue;
                        if ((j < k && k > i) || (j > k && k < i))
                            dp[k, i] = Math.Max(dp[k, i], dp[j, k] + 1);
                    }
            }
            var max = 0;
            for (int i = 0; i < sz; i++)
                for (int j = 0; j < sz; j++)
                    max = Math.Max(max, dp[i, j]);
            if (max<3) max = 0;
            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 main
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 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, T[] source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, 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 string ScanLine()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b != '\n'; b = (char)read())
                if (b == 0) break;
                else if (b != '\r') 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); }
    }
}
#endregion
0