結果

問題 No.992 最長増加部分列の数え上げ
ユーザー りあんりあん
提出日時 2020-02-14 21:47:30
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 370 ms / 2,000 ms
コード長 9,370 bytes
コンパイル時間 1,367 ms
コンパイル使用メモリ 123,372 KB
実行使用メモリ 72,684 KB
最終ジャッジ日時 2024-10-06 11:14:54
合計ジャッジ時間 13,411 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 32 ms
22,964 KB
testcase_01 AC 31 ms
25,316 KB
testcase_02 AC 33 ms
27,236 KB
testcase_03 AC 32 ms
27,508 KB
testcase_04 AC 149 ms
45,264 KB
testcase_05 AC 117 ms
42,480 KB
testcase_06 AC 169 ms
48,904 KB
testcase_07 AC 131 ms
44,496 KB
testcase_08 AC 87 ms
36,312 KB
testcase_09 AC 131 ms
42,712 KB
testcase_10 AC 171 ms
49,320 KB
testcase_11 AC 215 ms
54,220 KB
testcase_12 AC 72 ms
36,820 KB
testcase_13 AC 126 ms
41,908 KB
testcase_14 AC 128 ms
41,928 KB
testcase_15 AC 72 ms
34,692 KB
testcase_16 AC 312 ms
55,644 KB
testcase_17 AC 87 ms
36,424 KB
testcase_18 AC 126 ms
41,852 KB
testcase_19 AC 214 ms
53,920 KB
testcase_20 AC 362 ms
68,828 KB
testcase_21 AC 370 ms
70,872 KB
testcase_22 AC 356 ms
68,716 KB
testcase_23 AC 361 ms
72,672 KB
testcase_24 AC 366 ms
72,684 KB
testcase_25 AC 369 ms
68,580 KB
testcase_26 AC 360 ms
68,688 KB
testcase_27 AC 357 ms
70,756 KB
testcase_28 AC 357 ms
71,032 KB
testcase_29 AC 362 ms
70,748 KB
testcase_30 AC 265 ms
70,012 KB
testcase_31 AC 264 ms
63,860 KB
testcase_32 AC 263 ms
67,960 KB
testcase_33 AC 261 ms
63,996 KB
testcase_34 AC 264 ms
67,972 KB
testcase_35 AC 253 ms
67,200 KB
testcase_36 AC 255 ms
67,212 KB
testcase_37 AC 254 ms
67,344 KB
testcase_38 AC 254 ms
65,296 KB
testcase_39 AC 256 ms
67,216 KB
testcase_40 AC 288 ms
63,564 KB
testcase_41 AC 286 ms
65,620 KB
testcase_42 AC 285 ms
63,548 KB
testcase_43 AC 288 ms
63,460 KB
testcase_44 AC 290 ms
63,540 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.Threading;
using System.Text;
using System.Text.RegularExpressions;
using System.Diagnostics;
using static util;
using P = pair<int, int>;

class Program {
    static void Main(string[] args) {
        var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        var solver = new Solver(sw);
        // var t = new Thread(solver.solve, 1 << 26); // 64 MB
        // t.Start();
        // t.Join();
        solver.solve();
        sw.Flush();
    }
}

class Solver {
    StreamWriter sw;
    Scan sc;
    void Prt(string a) => sw.WriteLine(a);
    void Prt<T>(IEnumerable<T> a) => Prt(string.Join(" ", a));
    void Prt(params object[] a) => Prt(string.Join(" ", a));
    public Solver(StreamWriter sw) {
        this.sw = sw;
        this.sc = new Scan();
    }

    public void solve() {
        int n = sc.Int;
        var a = sc.IntArr;
        var lis = new List<pair<int, long>>[n];
        for (int i = 0; i < n; i++)
        {
            lis[i] = new List<pair<int, long>>();
        }
        for (int i = 0; i < n; i++)
        {
            int ng = -1, ok = i;
            while (ng < ok - 1) {
                int m = (ok + ng) / 2;
                if (lis[m].Count > 0 && lis[m].Last().v1 < a[i]) {
                    ng = m;
                }
                else {
                    ok = m;
                }
            }
            long c = lis[ok].Count == 0 ? 0 : lis[ok].Last().v2;
            if (ok == 0) {
                lis[ok].Add(new pair<int, long>(a[i], (c + 1) % M));
            }
            else {
                int k = lis[ok - 1].LowerBound(new pair<int, long>(a[i], -1), (x, y) => y.CompareTo(x)) - 1;
                if (k >= 0)
                    lis[ok].Add(new pair<int, long>(a[i], (c + lis[ok - 1].Last().v2 - lis[ok - 1][k].v2 + M) % M));
                else
                    lis[ok].Add(new pair<int, long>(a[i], (c + lis[ok - 1].Last().v2) % M));
            }
        }
        for (int i = n - 1; i >= 0 ; i--)
        {
            // DBG(i);
            // DBG(lis[i]);
            if (lis[i].Count > 0) {
                Prt(lis[i].Last().v2);
                return;
            }
        }



    }
}

class pair<T, U> : IComparable<pair<T, U>> {
    public T v1;
    public U v2;
    public pair() : this(default(T), default(U)) {}
    public pair(T v1, U v2) { this.v1 = v1; this.v2 = v2; }
    public int CompareTo(pair<T, U> a) {
        int c = Comparer<T>.Default.Compare(v1, a.v1);
        return c != 0 ? c : Comparer<U>.Default.Compare(v2, a.v2);
    }
    public override string ToString() => v1 + " " + v2;
    public void Deconstruct(out T a, out U b) { a = v1; b = v2; }
}
static class util {
    public static readonly int M = 1000000007;
    // public static readonly int M = 998244353;
    public static readonly long LM = 1L << 60;
    public static readonly double eps = 1e-11;
    public static void DBG(string a) => Console.Error.WriteLine(a);
    public static void DBG<T>(IEnumerable<T> a) => DBG(string.Join(" ", a));
    public static void DBG(params object[] a) => DBG(string.Join(" ", a));
    public static void Assert(params bool[] conds) {
        foreach (var cond in conds) if (!cond) throw new Exception();
    }
    public static pair<T, U> make_pair<T, U>(T v1, U v2) => new pair<T, U>(v1, v2);
    public static int CompareList<T>(IList<T> a, IList<T> b) where T : IComparable<T> {
        for (int i = 0; i < a.Count && i < b.Count; i++)
            if (a[i].CompareTo(b[i]) != 0) return a[i].CompareTo(b[i]);
        return a.Count.CompareTo(b.Count);
    }
    public static bool inside(int i, int j, int h, int w) => i >= 0 && i < h && j >= 0 && j < w;
    static readonly int[] dd = { 0, 1, 0, -1 };
    // static readonly string dstring = "RDLU";
    public static P[] adjacents(int i, int j)
        => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1])).ToArray();
    public static P[] adjacents(int i, int j, int h, int w)
        => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1]))
                                         .Where(p => inside(p.v1, p.v2, h, w)).ToArray();
    public static P[] adjacents(this P p) => adjacents(p.v1, p.v2);
    public static P[] adjacents(this P p, int h, int w) => adjacents(p.v1, p.v2, h, w);
    public static Dictionary<T, int> compress<T>(this IEnumerable<T> a)
        => a.Distinct().OrderBy(v => v).Select((v, i) => new { v, i }).ToDictionary(p => p.v, p => p.i);
    public static Dictionary<T, int> compress<T>(params IEnumerable<T>[] a) => compress(a.Aggregate(Enumerable.Union));
    public static T[] inv<T>(this Dictionary<T, int> dic) {
        var res = new T[dic.Count];
        foreach (var item in dic) res[item.Value] = item.Key;
        return res;
    }
    public static void swap<T>(ref T a, ref T b) where T : struct { var t = a; a = b; b = t; }
    public static void swap<T>(this IList<T> a, int i, int j) where T : struct { var t = a[i]; a[i] = a[j]; a[j] = t; }
    public static T[] copy<T>(this IList<T> a) {
        var ret = new T[a.Count];
        for (int i = 0; i < a.Count; i++) ret[i] = a[i];
        return ret;
    }
    public static void Deconstruct<T>(this IList<T> v, out T a) {
        a = v[0];
    }
    public static void Deconstruct<T>(this IList<T> v, out T a, out T b) {
        a = v[0]; b = v[1];
    }
    public static void Deconstruct<T>(this IList<T> v, out T a, out T b, out T c) {
        a = v[0]; b = v[1]; c = v[2];
    }
    public static void Deconstruct<T>(this IList<T> v, out T a, out T b, out T c, out T d) {
        a = v[0]; b = v[1]; c = v[2]; d = v[3];
    }
    public static void Deconstruct<T>(this IList<T> v, out T a, out T b, out T c, out T d, out T e) {
        a = v[0]; b = v[1]; c = v[2]; d = v[3]; e = v[4];
    }
}

class Scan {
    StreamReader sr;
    public Scan() { sr = new StreamReader(Console.OpenStandardInput()); }
    public Scan(string path) { sr = new StreamReader(path); }
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public string Str => sr.ReadLine().Trim();
    public pair<T, U> Pair<T, U>() {
        T a; U b;
        Multi(out a, out b);
        return new pair<T, U>(a, b);
    }
    public P P => Pair<int, int>();
    public int[] IntArr => StrArr.Select(int.Parse).ToArray();
    public long[] LongArr => StrArr.Select(long.Parse).ToArray();
    public double[] DoubleArr => StrArr.Select(double.Parse).ToArray();
    public string[] StrArr => Str.Split(new[]{' '}, StringSplitOptions.RemoveEmptyEntries);
    bool eq<T, U>() => typeof(T).Equals(typeof(U));
    T ct<T, U>(U a) => (T)Convert.ChangeType(a, typeof(T));
    T cv<T>(string s) => eq<T, int>()    ? ct<T, int>(int.Parse(s))
                       : eq<T, long>()   ? ct<T, long>(long.Parse(s))
                       : eq<T, double>() ? ct<T, double>(double.Parse(s))
                       : eq<T, char>()   ? ct<T, char>(s[0])
                                         : ct<T, string>(s);
    public void Multi<T>(out T a) => a = cv<T>(Str);
    public void Multi<T, U>(out T a, out U b) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]);
    }
    public void Multi<T, U, V>(out T a, out U b, out V c) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]);
    }
    public void Multi<T, U, V, W>(out T a, out U b, out V c, out W d) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]);
    }
    public void Multi<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]);
    }
}

static class Search {
    // x より大きいの項の index のうち最小のものを返す
    // x 以下の項の index のうち最大のもの + 1 を返す
    // そこに挿入
    public static int UpperBound<T>(this IList<T> a, T x) where T : IComparable<T> {
        int le = -1, u = a.Count;
        while (le < u - 1) {
            int m = (le + u) >> 1;
            if (a[m].CompareTo(x) > 0) u = m;
            else le = m;
        }
        return le + 1;
    }
    public static int UpperBound<T>(this IList<T> a, T x, Func<T, T, int> compare) {
        int le = -1, u = a.Count;
        while (le < u - 1) {
            int m = (le + u) >> 1;
            if (compare(a[m], x) > 0) u = m;
            else le = m;
        }
        return le + 1;
    }

    // n 未満の項の index のうち最大のもの + 1 を返す
    // n 以上の項の index のうち最小のものを返す
    // そこに挿入
    public static int LowerBound<T>(this IList<T> a, T x) where T : IComparable<T> {
        int l = -1, ue = a.Count;
        while (l < ue - 1) {
            int m = (l + ue) >> 1;
            if (a[m].CompareTo(x) < 0) l = m;
            else ue = m;
        }
        return ue;
    }
    public static int LowerBound<T>(this IList<T> a, T x, Func<T, T, int> compare) {
        int l = -1, ue = a.Count;
        while (l < ue - 1) {
            int m = (l + ue) >> 1;
            if (compare(a[m], x) < 0) l = m;
            else ue = m;
        }
        return ue;
    }
}
0