# Maximize Distance to Closest Person

## Description

In a row of `seats`, `1` represents a person sitting in that seat, and `0` represents that the seat is empty. 

There is at least one empty seat, and at least one person sitting.

Alex wants to sit in the seat such that the distance between him and the closest person to him is maximized. 

Return that maximum distance to closest person.

**Example 1:**

```
Input: [1,0,0,0,1,0,1]
Output: 2
Explanation: 
If Alex sits in the second open seat (seats[2]), then the closest person has distance 2.
If Alex sits in any other open seat, the closest person has distance 1.
Thus, the maximum distance to the closest person is 2.
```

**Example 2:**

```
Input: [1,0,0,0]
Output: 3
Explanation: 
If Alex sits in the last seat, the closest person is 3 seats away.
This is the maximum distance possible, so the answer is 3.
```

**Note:**

* `1 <= seats.length <= 20000`.
* `seats` contains only 0s or 1s, at least one `0`, and at least one `1`.

## Solution

Idea: maximum distance = max(# of leading zeros, # of trailing zeros, maximum distance between two ones / 2)

```cpp
class Solution {
public:
    int maxDistToClosest(vector<int>& seats) {
        int i = 0, n = seats.size();
        // no need to check if i < n because
        // there is at least one 1.
        while(seats[i] == 0) ++i;
        int max_len = i; // # of leading zeros
        while(i < n){
            int j = i + 1;
            while(j < n && seats[j] == 0) ++j;
            // if j == n, j - i - 1 == # of trailing zeros
            // else j - i == distance between two ones
            int len = j == n ? j - i - 1 : (j - i) / 2;
            if(len > max_len)
                max_len = len;
            i = j;
        }
        return max_len;
    }
};
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://twchen.gitbook.io/leetcode/array/maximize-distance-to-closest-person.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.