原题链接:https://smms.app/image/MLJEitcIkwUHlzj#google_vignette

#include<bits/stdc++.h>
using namespace std;
string s;
int n;
int t[300005],k =0;
int main (){
	cin >> n>>s;
	for (int i=0;i<n;i++)
		if(s[i]=='1')
			t[k]++;
		else
			k++;
		int d=1e9;
		for (int i=0;i<=k;i++)
		 d=min(d,(t[i]-1)/2);
		 
		int sum=0;
		for(int i=0;i<k;i++)
		    sum+=ceil(1.0*t[i]/(d*2+1));
		    
		cout << sum;
		
		return 0;
}