Submission #1513054

---

Source Code Expand

import std.array;
import std.stdio;
import std.range;
import std.algorithm;
import std.format;
import std.bigint;
import std.functional;
import std.string;
import std.conv;

void main()
{
	int N = readln().chomp.to!int();
	int[] c = iota(N).map!(_ => readln().chomp.to!int()).array;
	solve(c).writeln();
}

int solve(int[] C)
{
	C = [int.min] ~ C;
	int[] L = new int[](C.length);
	L[0] = 0;
	foreach (i; 1 .. C.length)
	{
		int m = int.min;
		foreach (j; 0 .. i)
		{
			if (C[j] < C[i])
			{
				m = max(m, L[j]);
			}
		}
		L[i] = m + 1;
	}

	return cast(int)(C.length - 1) - L.reduce!((a, b) => max(a, b));
}

Submission Info

Judge Result