AcWing 1659. 社交距离 I
#include <iostream>
using namespace std;
int n,m,ans;
string str;
int location[100010];
bool check(int num) {
int add=0;
add+=location[0]/num+(n-location[m-1]-1)/num;
if(add>=2) return true;
for(int i=0;i<m-1;i++){
add+=(location[i+1]-location[i])/num-1;
}
return add>=2;
}
int main() {
cin >> n;
int r=n,l=1;
cin >> str;
for(int i=0; i<n; i++) {
if(str[i]=='1')
location[m++]=i;
}
if(m==0) {
cout << n-1;
return 0;
}
for(int i=1;i<m;i++)
r=min(r,location[i]-location[i-1]);
while(l<=r)
{
int mid=(r+l)/2;
if(check(mid)) {
ans=mid;
l=mid+1;
}
else
r=mid-1;
}
cout << ans;
return 0;
}