Submission #167955

#TimeUsernameProblemLanguageResultExecution timeMemory
167955ThuleanxUntitled (POI11_tem)C++14
100 / 100
312 ms29944 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int n; cin>>n;
	int l[n], r[n];
	deque<int> dq;
	for (int i = 0; i < n; i++)
		cin>>l[i]>>r[i];
	int ans = 0, pos = -1;
	for (int i = 0; i < n; i++) {
		while (dq.size() && l[i] >= l[dq.back()]) dq.pop_back();
		dq.push_back(i);
		while (dq.size() && l[dq[0]] > r[i]) {
			pos = dq.front();
			dq.pop_front();
		}
		ans = max(ans, i-pos);
	}
	cout << ans << endl;

	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...