Description
At the entrance to the university, there is a huge rectangular billboard of size h*w (h is its height and w is its width). The board is the place where all possible announcements are posted: nearest programming competitions, changes in the dining room menu, and other important information.
On September 1, the billboard was empty. One by one, the announcements started being put on the billboard.
Each announcement is a stripe of paper of unit height. More specifically, the i-th announcement is a rectangle of size 1 * wi.
When someone puts a new announcement on the billboard, she would always choose the topmost possible position for the announcement. Among all possible topmost positions she would always choose the leftmost one.
If there is no valid location for a new announcement, it is not put on the billboard (that's why some programming contests have no participants from this university).
Given the sizes of the billboard and the announcements, your task is to find the numbers of rows in which the announcements are placed.
On September 1, the billboard was empty. One by one, the announcements started being put on the billboard.
Each announcement is a stripe of paper of unit height. More specifically, the i-th announcement is a rectangle of size 1 * wi.
When someone puts a new announcement on the billboard, she would always choose the topmost possible position for the announcement. Among all possible topmost positions she would always choose the leftmost one.
If there is no valid location for a new announcement, it is not put on the billboard (that's why some programming contests have no participants from this university).
Given the sizes of the billboard and the announcements, your task is to find the numbers of rows in which the announcements are placed.
Input
There are multiple cases (no more than 40 cases).
The first line of the input file contains three integer numbers, h, w, and n (1 <= h,w <= 10^9; 1 <= n <= 200,000) - the dimensions of the billboard and the number of announcements.
Each of the next n lines contains an integer number wi (1 <= wi <= 10^9) - the width of i-th announcement.
The first line of the input file contains three integer numbers, h, w, and n (1 <= h,w <= 10^9; 1 <= n <= 200,000) - the dimensions of the billboard and the number of announcements.
Each of the next n lines contains an integer number wi (1 <= wi <= 10^9) - the width of i-th announcement.
Output
For each announcement (in the order they are given in the input file) output one number - the number of the row in which this announcement is placed. Rows are numbered from 1 to h, starting with the top row. If an announcement can't be put on the billboard, output "-1" for this announcement.
Sample Input
3 5 5 2 4 3 3 3
Sample Output
1 2 1 3 -1
解题思路:
题目大意是给一个h * w的广告牌,再给n张1 * wi 的小广告,小广告必须尽可能贴在左上方,先输入的先贴。输出每张小广告贴在第几行,不能贴就输出-1。
用线段树存储广告牌上每行还能够贴的最大宽度。每贴一张就对线段树进行更新。
AC代码:
#include <iostream>
#include <cstdio>
using namespace std;
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1
const int maxn = 200005;
int Max[maxn << 2];
int h, w, n;
void PushUp(int rt)
{
Max[rt] = max(Max[rt << 1] , Max[rt << 1 | 1]);
}
void build(int l, int r, int rt)
{
if(l == r)
{
Max[rt] = w; // 建数存储每行能贴的最大宽度
return;
}
int m = (l + r) >> 1;
build(lson);
build(rson);
PushUp(rt);
}
void query(int a, int l, int r, int rt)
{
if(l == r)
{
Max[rt] -= a;
printf("%d\n", l);
return;
}
int m = (l + r) >> 1;
if(Max[rt << 1] >= a) // 询问的时候,先询问左子树,左子树不满足再询问右子树。
query(a, lson);
else
query(a, rson);
PushUp(rt);
}
int main()
{
int a;
while(scanf("%d%d%d", &h, &w, &n) != EOF)
{
if(h > n)
h = n;
build(1, h, 1);
while(n--)
{
scanf("%d", &a);
if(Max[1] < a) // 如果根节点的最大宽度已经小于小广告的宽度,则贴不了
printf("-1\n");
else
query(a, 1, h, 1);
}
}
return 0;
}