Submission #8,586

2024-01-22 13:08:51

cpp17

Accepted 80/80

231ms

37736 KiB

// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;
	cin >> n;
	map<int, int> a;
	for (int i = 0; i < n; i++) {
		int b;
		cin >> b;
		if (a[b - 1] == 0) {
			a[b] = b;
		} else {
			a[b] = a[b - 1];
			a[b - 1] = 0;
		}
	}

	int mini = n * 2;
	for (pair<int, int> sor : a) {
		if (sor.second != 0) {
			int lepes = max(sor.second - 1, n - sor.first) * 2;
			if (sor.second - 1 > n - sor.first) lepes--;
			if (lepes < mini) mini = lepes;
		}
	}

	cout << mini;
}

	Sum	Test	Verdict		Time	Memory
base	80/80
		1	Accepted	0/0	3ms	1812 KiB
		2	Accepted	0/0	3ms	2068 KiB
		3	Accepted	2/2	3ms	2224 KiB
		4	Accepted	3/3	3ms	2444 KiB
		5	Accepted	3/3	3ms	2660 KiB
		6	Accepted	2/2	4ms	2836 KiB
		7	Accepted	2/2	4ms	3124 KiB
		8	Accepted	2/2	4ms	3300 KiB
		9	Accepted	2/2	3ms	3216 KiB
		10	Accepted	2/2	4ms	3256 KiB
		11	Accepted	2/2	4ms	3252 KiB
		12	Accepted	2/2	4ms	3420 KiB
		13	Accepted	2/2	4ms	3432 KiB
		14	Accepted	2/2	4ms	3692 KiB
		15	Accepted	2/2	4ms	3804 KiB
		16	Accepted	2/2	4ms	3784 KiB
		17	Accepted	2/2	4ms	3796 KiB
		18	Accepted	4/4	231ms	23716 KiB
		19	Accepted	4/4	231ms	24980 KiB
		20	Accepted	4/4	182ms	26256 KiB
		21	Accepted	4/4	221ms	27528 KiB
		22	Accepted	4/4	166ms	28888 KiB
		23	Accepted	4/4	156ms	30032 KiB
		24	Accepted	4/4	187ms	31300 KiB
		25	Accepted	4/4	222ms	32640 KiB
		26	Accepted	4/4	152ms	33816 KiB
		27	Accepted	4/4	197ms	35152 KiB
		28	Accepted	4/4	158ms	36416 KiB
		29	Accepted	4/4	152ms	37736 KiB