Billboard
Time Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4292 Accepted Submission(s): 2003
Problem 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.
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
Each of the next n lines contains an integer number wi (1
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
Author
hhanger@zju
Source
HDOJ 2009 Summer Exercise（5）
Recommend
lcy
当h>n时只需要开n大小的线段树即可
#include
#include
#include
#include
#define N 200100
using namespace std;
class node
{
public:
int l,r,ma;
}root[4*N];
int n,q;
int M;
void build(int t,int l,int r,int m)
{
root[t].l=l;root[t].r=r;
if(root[t].l==root[t].r)root[t].ma=m;
else
{
build(t=pos){M=root[t].l;root[t].ma-=pos;return;}
if(root[t].ma=pos)update(tN)
n=N-10;
build(1,1,n,m);
for(int i=0;i服务器托管，北京服务器托管，服务器租用 http://www.fwqtg.net
机房租用，北京机房租用，IDC机房托管， http://www.fwqtg.net
相关推荐: VisualStudio2022配置PCL点云库教程
属性管理器 首先，打开属性管理器：视图–其他窗口–属性管理器 打开后如图所示，选中Debug|x64，右键单击，选择属性 如图所示，需要修改的是VC++目录中的包含目录和库目录： ** 包含目录 添加内容如下： D:PCL 1.12.1includepcl-1…
