징검다리 건너기 C++

https://programmers.co.kr/learn/courses/30/lessons/64062

코딩테스트 연습 - 징검다리 건너기

#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int solution(vector<int> stones, int k) {
    int answer = 0;
    
    int low = 0;
    int high = *max_element(stones.begin(),stones.end());
    
    while(low < high){
        int mid = (low + high)/2;
        int count = 0;
        int max_count = 0;
        
        for(int k=0; k<stones.size(); k++){
            int tmp = stones[k] - mid;
            if(tmp <= 0){
                count ++;
            }
            else{
                max_count = max(count,max_count);
                count = 0;
            }
        }
        
        max_count = max(count,max_count);
        
        if(max_count >=k){
            high = mid;
        }
        else{
            low = mid+1;
        }
    }
    
    return low;
}