class Solution {

public:

    int maxDistToClosest(vector<int>& seats) {

        int res = , n = seats.size();

        vector<int> pos;

        for(int i=; i<n; ++i)

        {

            if(seats[i] == ) pos.push_back(i);

        }

        for(int i=; i<pos.size(); ++i)

        {

            if(i==) res = max(res, pos[i]);

            else res = max(res, (pos[i]-pos[i-])/);

        }

        if(!pos.empty()) res = max(res, n--pos.back());

        return res;

    }

};