区间交集最值

最新推荐文章于 2024-11-15 20:16:11 发布

ღCauchyོꦿ࿐

最新推荐文章于 2024-11-15 20:16:11 发布

阅读量438

点赞数 3

分类专栏： Codeforces 文章标签：算法 c++ 数据结构

本文链接：https://blog.csdn.net/qq_52678569/article/details/127196716

版权

Codeforces 专栏收录该内容

8 篇文章 0 订阅

订阅专栏

D. Fedor and coupons

文章目录

题意

All our characters have hobbies. The same is true for Fedor. He enjoys shopping in the neighboring supermarket.

The goods in the supermarket have unique integer ids. Also, for every integer there is a product with id equal to this integer. Fedor has n discount coupons, the i-th of them can be used with products with ids ranging from li to ri, inclusive. Today Fedor wants to take exactly k coupons with him.

Fedor wants to choose the k coupons in such a way that the number of such products x that all coupons can be used with this product x is as large as possible (for better understanding, see examples). Fedor wants to save his time as well, so he asks you to choose coupons for him. Help Fedor!

Input

The first line contains two integers $n$ and ${k (1 ≤ k ≤ n ≤ 3·10^5) }$ — the number of coupons Fedor has, and the number of coupons he wants to choose.

Each of the next $n$ lines contains two integers $l_i$ and ${r_i ( -10^9 ≤ l_i ≤ r_i ≤ 10^9) }$ — the description of the $i - t h$ coupon. The coupons can be equal.

Output

In the first line print single integer — the maximum number of products with which all the chosen coupons can be used. The products with which at least one coupon cannot be used shouldn’t be counted.

In the second line print k distinct integers $p 1, p 2, ..., p k (1 \leq p i \leq n)$ — the ids of the coupons which Fedor should choose.

If there are multiple answers, print any of them.

Examples

样例 #1

31
1 2

样例 #2

0
1 2

样例 #2

21
3 4

思路

题意：给出n个区间，求m个区间的最大覆盖，并输出覆盖的区间编号

k个区间交集 = 右端点最小值 - 左端点最大值

按区间左端点从小到大排序，用优先队列（小顶堆）维护k个右端点，保证每次选的都是最小的右端点r，用r减去这k个区间的最大l（排序后当前就是最大的l），此时求得即为被覆盖k次的区间的长度。不断进行，更新长度最大值。

int n, m;

struct node {
	int l, r;
	int id;
	bool operator<(const node &A) const {
		if (l == A.l) return r < A.r;
		return l < A.l;
	}
} a[N];

void solve() {
	cin >> n >> m;
	rep(i, 1, n) cin >> a[i].l >> a[i].r, a[i].id = i;
	sort(a + 1, a + 1 + n);
	pql q;
	int mx = 0, xx, yy;
	rep(i, 1, n) {
		q.push(a[i].r);
		if (q.sz > m) q.pop(); 
		int len = q.top() - a[i].l + 1; 
		if (q.sz == m && mx < len) {
			mx = len; 
			xx = a[i].l; 
			yy = q.top(); 
		} 
	}
	cout << mx << endl; 
	if (mx == 0) xx = 2e9, yy = -2e9; 
	for (int i = 1, j = 0; i <= n && j < m; i++) {
		if (a[i].l <= xx && a[i].r >= yy) {
			j++; 
			cout << a[i].id << ' ';
		} 
	}
}