帮帮萌新

int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
	scanf("%d", &stu[i]);
}
for (int i = 1; i <= n; i++) {
	dp1[i] = 1;
	for (int j = 1; j < i; j++) {
		if (stu[i] > stu[j])
			dp1[i] = max(dp1[i], dp1[j] + 1);
	}
	
}
stu[n + 1] = 0;
for (int i = 1; i <= n; i++) {
	dp2[i] = 1;
	for (int j = 1; j <i; j++) {
		if (stu[i] < stu[j])
			dp2[i] = max(dp2[j] + 1, dp2[i]);
	}
	
}

int maxn = 0;
for (int i = 1; i <= n; i++) {
	maxn = max(dp1[i] + dp2[i], maxn);
}
printf("%d",n-maxn+1);
return 0;