YOJ207 嚴神的機器人 II

貪心即可

#include<bits/stdc++.h>
using namespace std;
int n;char s[210000];
int main(){
	//freopen("b.in","r",stdin);
	scanf("%d",&n);
	scanf("%s",s+1);
	vector<int> a,b;
	for (int i=1;i<=n*2;++i){
		if (s[i]=='0') a.push_back(i);else b.push_back(i);
	}long long ans=0;
	//for (int i=1;i<=n;++i) printf("%d %d\n",a[i],b[i]);
	for (int i=0;i<n;++i) ans+=abs(a[i]-b[i]);
	printf("%lld\n",ans);
	return 0;
}