849. Maximize Distance to Closest Person

 class Solution

 {

 public:

     int maxDistToClosest(vector<int>& seats)

     {

         int count=;

         int maxseat=;

         for(int i:seats)                     //count the max length of continuous 0

         {

             if(i==)

                 count++;

             else

             {

                 maxseat=max(maxseat,count);

                 count=;

             }

         }

         maxseat=(maxseat+)/;

         count=;

         int i=,j=seats.size()-;

         while(seats[i++]==)              //count the max length of continuous 0 in the front

             count++;

         maxseat=max(count,maxseat);

         count=;

         while(seats[j--]==)              //count the max length of continuous 0 in the last

             count++;

         maxseat=max(maxseat,count);

         return maxseat;

     }

 };

此题不难，问题不大