code_forces_ec_109_D_Armchairs

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
const int INF = (int)1e9;

int main() {
	int n,temp;
	cin >> n;
	vector<int> a;
	vector<int> b;
	a.push_back(-1);
	b.push_back(-1);
	for (int i = 0; i < n; i++) {
		cin >> temp;
		if (temp == 1)a.push_back(i);
		else b.push_back(i);
	}
	
	vector<vector<int>> dp(a.size() + 1, vector<int>(b.size() + 1, INF));
	for (int i = 0; i <= b.size(); i++)
		dp[0][i] = 0;

	for (int i = 1; i <= a.size(); i++) {
		for (int j = i; j <= b.size(); j++) {
			dp[i][j] = min(dp[i][j-1], dp[i-1][j-1] + abs(a[i] -b[j]) );
		}
	}
	cout << dp[a.size()][b.size()];

}