题意:
某系统有k个内存块,用户提出了n个请求,每个内存块每次只能处理一个请求。如果某个请求到达时,所有内存块都被占用,则该请求被忽略(永不被执行),否则将该请求交给某个内存块处理(从i%k,(i+1)%k ,个块依次循环向右查找第一个空闲的块,然后把当前请求提交给这个块)。试求处理请求最多的内存块号。
思路:
用线段树维护区间内结束时间的最小值
对于查找操作先查找区间[i%k,k]内看是否有结束时间最小最值小于当前的起始时间
若没有再找区间[1,i%k-1]区间的内是否满足(从1开始建树).
再每次查找时为满足题目要求先看左区间是否满足条件的再查找右区间.
#include<bits/stdc++.h>
#include <unordered_map>
using namespace std;
template<class...Args>
void debug(Args... args) {//Parameter pack
auto tmp = { (cout << args << ' ', 0)... };
cout << "\n";
}
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll>pll;
typedef pair<int, int>pii;
const ll N = 1e5 + 5;
const ll INF = 0x7fffffff;
const ll MOD = 1e9 + 7;
struct node {
int l, r;
ll minv;
} tree[N << 2];
void push_up(int root) {
tree[root].minv = min(tree[root << 1].minv, tree[root << 1 | 1].minv);
}
void build(int root, int l, int r) {
if (l == r)tree[root] = { l,r,0 };
else {
tree[root] = { l,r };
int mid = l + r >> 1;
build(root << 1, l, mid);
build(root << 1 | 1, mid + 1, r);
push_up(root);
}
}
void modify(int root, int pos, ll val) {
if (tree[root].l == tree[root].r && tree[root].r == pos) {
tree[root].minv = val;
}
else {
int mid = tree[root].l + tree[root].r >> 1;
if (pos <= mid)modify(root << 1, pos, val);
if (pos > mid)modify(root << 1 | 1, pos, val);
push_up(root);
}
}
ll query(int root, int l, int r, ll val) {
if (tree[root].l == tree[root].r)return tree[root].l;
else {
ll mid = tree[root].l + tree[root].r >> 1;
ll ans = -1;
if (l <= mid && tree[root << 1].minv <= val) {//要查询的区间和当前节点的左子节点所管辖的区间有交集则优先找左子节点
ans = query(root << 1, l, r, val);
}
if (ans == -1 && r > mid && tree[root << 1 | 1].minv <= val) {//再保证查询左子节点无果后看是否与右子节点管辖区间有交集
ans = query(root << 1 | 1, l, r, val);
}
return ans;
}
}
ll ans[N];
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int k, n;
cin >> k >> n;
build(1, 1, k);
ll maxv = 0;
for (int i = 0; i < n; i++) {
ll a, p;
cin >> a >> p;
ll pos = (i % k) + 1;
ll temp = query(1, pos, k, a);
if (temp == -1) {
temp = query(1, 1, pos - 1, a);
if (temp != -1) {
ans[temp]++;
maxv = max(maxv, ans[temp]);
modify(1, temp, a + p);
}
}
else {
ans[temp]++;
maxv = max(maxv, ans[temp]);
modify(1, temp, a + p);
}
}
bool flag = false;
for (int i = 1; i <= k; i++) {
if (!flag && ans[i] == maxv) {
cout << i - 1;
flag = true;
}
else if (ans[i] == maxv)cout << " " << i - 1;
}
return 0;
}