제출 #167955

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
167955		Thuleanx	무제 (POI11_tem)	C++14	100 / 100	312 ms	29944 KiB

Main

#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;
}

• Subtask 1: 8 / 8
• Subtask 2: 8 / 8
• Subtask 3: 8 / 8
• Subtask 4: 8 / 8
• Subtask 5: 8 / 8
• Subtask 6: 8 / 8
• Subtask 7: 8 / 8
• Subtask 8: 8 / 8
• Subtask 9: 9 / 9
• Subtask 10: 9 / 9
• Subtask 11: 9 / 9
• Subtask 12: 9 / 9