给定k个有序数组, 每个数组有个N个元素,找出一个最小的闭区间,使其包含每个数组中的至少一个元素。
给定两个区间[a,b], [c,d]:
如果 b-a < d-c,则认为[a, b]是更小的区间;
如果 b-a == d-c,且a < c,则认为[a, b]是更小的区间。
输入样例
3 3
2 12 14
2 6 9
4 7 19
按元素大小扔进优先队列,每次弹出最小值扔进单调队列。
删除单调队列无用元素后,维护区间最小值
#include <bits/stdc++.h>
using namespace std;
struct Node {
int x, k, idx;
//val x
//group k
//no idx
Node() {}
Node(int x, int k, int idx) : x(x), k(k), idx(idx) {}
bool operator < (const Node& o) const {
return x > o.x;
}
};
priority_queue<Node>pq;
queue<Node>q;
unordered_map<int, int>mp;
int main() {
int k, n, x;
scanf("%d%d", &k, &n);
for (int i = 0; i < k; ++ i) {
for (int j = 0; j < n; ++ j) {
scanf("%d", &x);
pq.push(Node(x, i, j));
}
}
int ans = 0x3f3f3f3f, from = 0, to = 0, cnt = 0;
while (!pq.empty()) {
Node top = pq.top();
pq.pop();
q.push(top);
mp[top.k]++;
if (mp[top.k] == 1) {
cnt++;
}
while (mp[q.front().k] > 1) {
mp[q.front().k]--;
q.pop();
}
if (cnt == k) {
int ll = q.front().x;
int rr = top.x;
int cur = rr - ll;
if (cur < ans) {
ans = cur;
from = ll;
to = rr;
}
}
}
cout << from << ' ' << to << endl;
return 0;
}