题目1131：合唱队形

#include <cstdio>
#include <algorithm>

using namespace std;

const int N = 110;
int a
;
int f1
, f2
;

int main()
{
int n;

#ifndef ONLINE_JUDGE
freopen("d:\\OJ\\uva_in.txt", "r", stdin);
#endif // ONLINE_JUDGE

while (scanf("%d", &n) == 1 && n) {
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}

for (int i = 0; i < n; i++) {
f1[i] = 1;
for (int j = 0; j < i; j++) {
if (a[i] > a[j]) {
f1[i] = max(f1[i], f1[j] + 1);
}
}
}

for (int i = n - 1; i >= 0; i--) {
f2[i] = 1;
for (int j = i + 1; j < n; j++) {
if (a[i] > a[j]) {
f2[i] = max(f2[i], f2[j] + 1);
}
}
}

int ans = 0;
for (int i = 0; i < n; i++) {
ans = max(ans, f1[i] + f2[i] - 1);
}

printf("%d\n", n - ans);
}
return 0;
}