Billboard(海报粘贴&简单的线段树)
2014-07-27 14:49
330 查看
题目来源:[NWPU][2014][TRN][13]线段树第一讲 G 题
http://vjudge.net/contest/view.action?cid=50850#problem/G
作者:npufz
题目:
G - Billboard
Time Limit:8000MS Memory Limit:32768KB 64bit IO Format:%I64d
& %I64u
Submit Status
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 <= 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
代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
using namespace std;
int high1;
typedef struct rootpoint
{
int le,ri;
int mawid;
int mid()
{
return (le+ri)/2;
}
} rootpoi;
rootpoi tree[800050];
int built (int root,int l,int r,int wid )
{
if(l==r)
{
tree[root].le=l;
tree[root].ri=r;
tree[root].mawid=wid;
return 0;
}
if(l!=r)
{
tree[root].le=l;
tree[root].ri=r;
tree[root].mawid=wid;
built(root*2,l,(l+r)/2,wid);
built(root*2+1,(l+r)/2+1,r,wid);
}
return 0;
}
int zhantie(int root,int wid1)
{
if(tree[root].mawid<wid1) return 0;
if(tree[root].le==tree[root].ri&&tree[root].mawid>=wid1)
{
high1=tree[root].le;
tree[root].mawid=tree[root].mawid-wid1;
return 0;
}
else if(tree[root*2].mawid>=wid1)
{
zhantie(root*2,wid1);
}
else
{
zhantie(root*2+1,wid1);
}
tree[root].mawid=max(tree[root*2].mawid,tree[root*2+1].mawid);
return 0;
}
int main()
{
int n,hi,wid,i,j,k,realhi;
while(~scanf("%d%d%d",&hi,&wid,&n))
{
realhi=min(hi,n);
built (1,1,realhi,wid);
for(i=0;i<n;i++)
{ int wid1;
scanf("%d",&wid1);
high1=-1;
zhantie(1,wid1);
printf("%d\n",high1);
}
}
return 0;
}
反思:
线段树的构造主要是维护好子节点的变化对根节点的影响,看准输入输出很重要
http://vjudge.net/contest/view.action?cid=50850#problem/G
作者:npufz
题目:
G - Billboard
Time Limit:8000MS Memory Limit:32768KB 64bit IO Format:%I64d
& %I64u
Submit Status
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 <= 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
代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
using namespace std;
int high1;
typedef struct rootpoint
{
int le,ri;
int mawid;
int mid()
{
return (le+ri)/2;
}
} rootpoi;
rootpoi tree[800050];
int built (int root,int l,int r,int wid )
{
if(l==r)
{
tree[root].le=l;
tree[root].ri=r;
tree[root].mawid=wid;
return 0;
}
if(l!=r)
{
tree[root].le=l;
tree[root].ri=r;
tree[root].mawid=wid;
built(root*2,l,(l+r)/2,wid);
built(root*2+1,(l+r)/2+1,r,wid);
}
return 0;
}
int zhantie(int root,int wid1)
{
if(tree[root].mawid<wid1) return 0;
if(tree[root].le==tree[root].ri&&tree[root].mawid>=wid1)
{
high1=tree[root].le;
tree[root].mawid=tree[root].mawid-wid1;
return 0;
}
else if(tree[root*2].mawid>=wid1)
{
zhantie(root*2,wid1);
}
else
{
zhantie(root*2+1,wid1);
}
tree[root].mawid=max(tree[root*2].mawid,tree[root*2+1].mawid);
return 0;
}
int main()
{
int n,hi,wid,i,j,k,realhi;
while(~scanf("%d%d%d",&hi,&wid,&n))
{
realhi=min(hi,n);
built (1,1,realhi,wid);
for(i=0;i<n;i++)
{ int wid1;
scanf("%d",&wid1);
high1=-1;
zhantie(1,wid1);
printf("%d\n",high1);
}
}
return 0;
}
反思:
线段树的构造主要是维护好子节点的变化对根节点的影响,看准输入输出很重要
相关文章推荐
- (线段树功能:update:成段替换 query:简单hash)Mayor's posters
- 线段树-hdu2795 Billboard(贴海报)
- hdu 3698 Let the light guide us(线段树优化&简单DP)
- HDU 2795 Billboard //线段树简单应用
- poj 2528 Mayor's posters(线段树 离散化 区间更新 贴海报)
- HDOJ 5360 优先队列&简单线段树
- 线段树-hdu2795 Billboard(贴海报)
- hdu(2795)——Billboard(简单的线段树的询问,以及建树的技巧)
- 几道简单的线段树入门题 POJ3264&&POJ3468&&POJ2777
- hdoj 2795 Billboard 【线段树】&&【二叉树】
- HDU 2795 Billboard(线段树:找到线段树中>=给定值的第一个元素位置 并 更新该点)
- poj 2528 Mayor's posters 简单离散化+线段树
- POJ 2528 Mayor's posters(离散化 线段树 贴海报)
- 几道简单的线段树入门题 POJ3264&&POJ3468&&POJ2777
- 安全职业生涯进阶:92 个简单步骤 "破解" 安全行业
- js入门·循环与判断/利用函数的简单实例/使用对象/列举对象属性的名称
- 使用xml+asp.net打造简单的站点导航&管理站点友情链接
- 开山之作,简单说说什么是"集群(Cluster)"
- 简单与争用simpleness & contention
- Microsoft的软件开发简单流程 -- 转自tassadar's blog