lower_bound(一个不怎么好的栗子）

B. Distances to Zero
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

You are given the array of integer numbers a0, a1, …, an - 1. For each element find the distance to the nearest zero (to the element which equals to zero). There is at least one zero element in the given array.
Input

The first line contains integer n (1 ≤ n ≤ 2·105) — length of the array a. The second line contains integer elements of the array separated by single spaces ( - 109 ≤ ai ≤ 109).
Output

Print the sequence d0, d1, …, dn - 1, where di is the difference of indices between i and nearest j such that aj = 0. It is possible that i = j.
Examples
Input

9
2 1 0 3 0 0 3 2 4

Output

2 1 0 1 0 0 1 2 3

Input

5
0 1 2 3 4

Output

0 1 2 3 4

Input

7
5 6 0 1 -2 3 4

Output

2 1 0 1 2 3 4

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
typedef long long ll;
using namespace std;
const int MAX = 1e6;
int p[MAX];
int main()
{
    int n,m;
    int cnt=0;
    cin >> n;
    for(int i=0;i<n;i++){
        scanf("%d",&m);
        if(m==0)
            p[cnt++]=i;
    }
    p[cnt]=INT_MAX;//为了处理后面没有零的情况
    int ans;
    for(int i=0;i<n;i++){
        int *v=lower_bound(p,p+cnt,i);//
        ans=abs(*v-i);
        if(v>&p[0]){//前面没有0的情况
            ans=min(ans,abs(*(v-1)-i));
        }
        if(i!=0)
            printf(" %d",ans);
        else
            printf("%d",ans);
    }
    return 0;
}

这样写一个k就可以解决lower_bound的所有问题。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
typedef long long ll;
using namespace std;
const int MAX = 1e6;
int p[MAX];
int main()
{
    int n,m;
    int cnt=0;
    cin >> n;
    for(int i=0;i<n;i++){
        scanf("%d",&m);
        if(m==0)
            p[cnt++]=i;
    }
    int ans;
    int k=0;
    for(int i=0;i<n;i++){
        ans=abs(i-p[k]);
        if(ans==0)
            k++;
        else{
            if(k>0){
                ans=min(ans,abs(p[k-1]-i));
            }
        }
        if(i!=0)
            printf(" %d",ans);
        else
            printf("%d",ans);
    }
    return 0;
}