본문 바로가기

코테

[Codility] MaxNonoverlappingSegments C++

반응형
int solution(vector<int> &A, vector<int> &B) {
    // write your code in C++14 (g++ 6.2.0)
    if(A.size()<1)  return 0;
    int end = B[0];
    int answer=0;
    for(int i=0; i<A.size(); i++){
        if(A[i]>end){
            answer++;
            end = B[i];
        }
    }
    return answer+1;
}
반응형

'코테' 카테고리의 다른 글

[Codility] ChocolatesByNumbers C++  (0) 2022.01.04
[Codility] CountFactors C++  (0) 2022.01.03
[Codility] NumberSolitaire C++  (0) 2021.12.30
[Codility] MaxDoubleSliceSum C++  (0) 2021.12.30
[Codility] MaxProfit C++  (0) 2021.12.30