class Solution {
public:
    int maxDistToClosest(vector<int>& seats) {
        int seat = 0, len = seats.size();
        if (seats[0] == 0) {
            int i = 0;
            while (!seats[i])
                i++, seat++;
        }
        if (!seats[len-1]) {
            int tempseat = len - 1;
            while (!seats[tempseat])
                tempseat--;
            tempseat = len - tempseat - 1;
            seat = tempseat > seat ? tempseat : seat;
        }
        int temp = 0;
        for (int i = 0; i < len; i++) {
            if (seats[i]) {
                seat = int((temp + 1) / 2) > seat ? int((temp + 1) / 2) : seat;
                temp = 0;
            }
            else temp++;
        }
        return seat;
    }
};