백준 15593번 Lifeguards(Bronze)

문제 링크입니다: https://www.acmicpc.net/problem/15593

N의 범위가 작기 때문에 직접 시뮬레이션을 돌려도 TLE가 발생하지 않습니다!

#include <iostream>

#include <algorithm>

using namespace std;

 

const int MAX = 1000 + 1;

 

pair<int, int> lifeguard[100];

int shifts[MAX];

 

int main(void)

{

        ios_base::sync_with_stdio(0);

        cin.tie(0);

        int N;

        cin >> N;

 

        for (int i = 0; i < N; i++)

        {

                 cin >> lifeguard[i].first >> lifeguard[i].second;

 

                 for (int j = lifeguard[i].first; j < lifeguard[i].second; j++)

                         shifts[j]++;

        }

 

        int result = 0;

        for (int i = 0; i < N; i++)

        {

                 for (int j = lifeguard[i].first; j < lifeguard[i].second; j++)

                         shifts[j]--;

 

                 int temp = 0;

                 for (int i = 0; i < MAX; i++)

                         if (shifts[i])

                                 temp++;

 

                 result = max(result, temp);

 

                 for (int j = lifeguard[i].first; j < lifeguard[i].second; j++)

                         shifts[j]++;

        }

        cout << result << "\n";

        return 0;

}

개발환경:Visual Studio 2017

지적, 조언, 질문 환영입니다! 댓글 남겨주세요~