codeforce 803-B 二分查找

#include<bits/stdc++.h>
using namespace std;
const int maxn = 2e5+10;
int a[maxn],ans[maxn];
vector<int>v;

int main()
{
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
        if(!a[i])v.push_back(i);
    }
    for(int i=1;i<=n;i++){
        if(a[i]){
            if(i<v[0])ans[i] = v[0]-i;
            else if(i>v[v.size()-1])ans[i]=i-v[v.size()-1];
            else {

                int lb = lower_bound(v.begin(),v.end(),i)-v.begin()-1;
                int ub = upper_bound(v.begin(),v.end(),i)-v.begin();
                ans[i] = min(abs(i-v[lb]),abs(v[ub]-i)); 
            }   
        }
    }
    for(int i=1;i<=n;i++)
        printf("%d%c",ans[i],i==n?'\n':' ');
    return 0;
} 

#include<bits/stdc++.h>
using namespace std;
const int maxn = 2e5+10;
int a[maxn],ans[maxn];
vector<int>v;
int lowerbound(int x)
{
    int l = 0,r = v.size()-1,mid;
    while(l<=r){
        mid = l+r>>1;
        if(x<=v[mid])r = mid-1;
        else l = mid+1;
    }
    return l;
}
int upperbound(int x){
    int l = 0,r = v.size()-1,mid;
    while(l<=r){
        mid = l+r>>1;
        if(x>=v[mid])l = mid+1;
        else r = mid-1;
    }
    return l;
}
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
        if(!a[i])v.push_back(i);
    }
    for(int i=1;i<=n;i++){
        if(a[i]){
            if(i<v[0])ans[i] = v[0]-i;
            else if(i>v[v.size()-1])ans[i]=i-v[v.size()-1];
            else {
                int lb = lowerbound(i)-1;
                int ub = upperbound(i);
                ans[i] = min(abs(i-v[lb]),abs(v[ub]-i)); 
            }   
        }
    }
    for(int i=1;i<=n;i++)
        printf("%d%c",ans[i],i==n?'\n':' ');
    return 0;
} 

对数据进行预处理
把0的位置存下来 然后对枚举其他元素 二分0的位置的上下界 找近的填进来就行