This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main () {
int n;
cin >> n;
pair <int, int> arr[n + 1];
for (int i = 1; i <= n; i++) cin >> arr[i].first >> arr[i].second;
int q;
cin >> q;
while (q--) {
int l, r;
cin >> l >> r;
map <int, int> x;
for (int i = l; i <= r; i++) {
x[arr[i].first]++;
x[arr[i].second + 1]--;
}
int cur = 0;
int mx = 0;
for (auto i : x) {
cur += i.second;
mx = max(mx, cur);
}
cout << mx << '\n';
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |