Submission #1513005

---

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)
{
	int result = int.min;
	int[] L = new int[](C.length+1);
	L[] = int.max;
	L[0] = int.min;
	foreach (c; C)
	{
		foreach_reverse (i, l; L)
		{
			if (l < c)
			{
				L[i + 1] = c;
				result = max(result, cast(int)i + 1);
			}
		}
	}
	return cast(int)C.length - result;
}

Submission Info

Judge Result