Submission #4018115

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <utility>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <cmath>
#include <queue>
#include <map>
using namespace std;
typedef long long ll;
const int INF = 1<<30; 
const int MOD = 1e9 + 7;
const int dy[] = {1, 0, -1, 0};
const int dx[] = {0, 1, 0, -1};
const int MAX_N = 1000100;
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    int color[MAX_N] = {};
    for(int i = 0; i < n; i++)
    {
        int a, b; cin >> a >> b;
        color[a]++;
        color[b + 1]--;
    }
    int ans = -1;
    for(int i = 0; i < MAX_N; i++)
    {
        color[i] += color[i - 1];
        ans = max(color[i], ans);
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result