题目链接
这个题只要稍加思索就会变成线段树裸题。首先我们维护的线段树是每一行还剩的空间。(初始为w)贴海报其实就是单点修改,问题是往哪里插入呢。我们查询剩余空间的时候,只要左子树区间每行剩余区间的最大值大于等于要插入的海报,我们就往左子树搜索。如果左子树空间不足,右子树有空间,就往右子树搜索。都不足就返回-1。即普通题目查询是知位置查数值,这个题目是知数值查位置。
下面是ac代码:
#include <iostream>
#include <cstdio>
#include <queue>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <cstdio>
#define ll long long
using namespace std;
const int N = 2e5+100;
const int inf = 0x3f3f3f3f;
struct Node
{
int l, r;
int sum;
}tr[N<<2];
int h, w, n;
int mx = 0;
void build(int p, int l, int r)
{
mx = max(mx, p);
tr[p].l = l; tr[p].r = r;
if (l == r) {tr[p].sum = w; return;}
int mid = (l + r) >> 1;
build(p<<1, l, mid);
build(p<<1|1, mid+1, r);
tr[p].sum = w;
}
void change(int p, int ans, int x)
{
if (tr[p].l == tr[p].r) {tr[p].sum -= x; return;}
int mid = (tr[p].l + tr[p].r) >> 1;
if (ans <= mid) change(p<<1, ans, x);
else change(p<<1|1, ans, x);
tr[p].sum = max(tr[p<<1].sum, tr[p<<1|1].sum);
}
int ask(int p, int x)
{
if (tr[p].l == tr[p].r)
{return tr[p].l;}
if (tr[p<<1].sum >= x) return ask(p<<1, x);
if (tr[p<<1|1].sum >= x) return ask(p<<1|1, x);
return -1;
}
void print()
{
for (int i = 1; i <= mx; i++)
{
cout << tr[i].l << " " << tr[i].r << " " <<tr[i].sum << endl;
}
cout << "-----------------------" << endl;
}
int main()
{
while(scanf("%d%d%d", &h, &w, &n) != EOF)
{
int gg = min(h, 200000);
build(1, 1, gg);
// print();
for (int i = 1; i <= n; i++)
{
int x;
scanf("%d", &x);
int ans = ask(1, x);
if (ans != -1)
change(1, ans, x);
// print();
printf("%d\n", ans);
}
}
return 0;
}