#include <bits/stdc++.h>

using namespace std;

const int N = 107;

int n, a[N], dp[N], dp1[N], mx;

int main() {
	scanf ("%d", &n);
	for (int i = 1; i <= n; i++) {
		scanf ("%d", &a[i]);
		dp[i] = dp1[i] = 1;
	}
	for (int i = 2; i <= n; i++) {
		for (int j = 1; j < i; j++) {
			if (a[i] > a[j]) dp[i] = max(dp[i], dp[j] + 1);
		}
		mx = max(mx, dp[i]);
	}
	for (int i = 2; i <= n; i++) {
		for (int j = 1; j < i; j++) {
			if (a[i] < a[j]) dp[i] = max(dp[i], dp[j] + 1);
		}
		mx = max(mx, dp[i]);
	}
	printf ("%d", n - mx);
	return 0;
}

只是怎么过的？（玄关）