hdu 2795 Billboard 线段树单点更新
2015-04-21 11:02
253 查看
Billboard
Time Limit: 1 Sec Memory Limit: 256 MB题目连接
http://acm.hdu.edu.cn/showproblem.php?pid=2795Description
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 3Sample Output
12
1
3
-1
HINT
[b]题意[/b]有一个w*h的版,然后让你贴海报,海报贴的方法是,优先贴最高的,然后再贴最左边的
[b]题解:
[/b]
线段树单点更新
主要问题就是建树的时候,需要稍微注意一下,因为只有200000个海报,所以只要建200000这么大的树就好了
[b]代码:[/b]
//qscqesze #include <cstdio> #include <cmath> #include <cstring> #include <ctime> #include <iostream> #include <algorithm> #include <set> #include <vector> #include <sstream> #include <queue> #include <typeinfo> #include <fstream> #include <map> #include <stack> typedef long long ll; using namespace std; //freopen("D.in","r",stdin); //freopen("D.out","w",stdout); #define sspeed ios_base::sync_with_stdio(0);cin.tie(0) #define maxn 500010 #define mod 10007 #define eps 1e-9 int Num; char CH[20]; //const int inf=0x7fffffff; //нчоч╢С const int inf=0x3f3f3f3f; /* inline void P(int x) { Num=0;if(!x){putchar('0');puts("");return;} while(x>0)CH[++Num]=x%10,x/=10; while(Num)putchar(CH[Num--]+48); puts(""); } */ //************************************************************************************** inline ll read() { int x=0,f=1;char ch=getchar(); while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();} while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();} return x*f; } inline void P(int x) { Num=0;if(!x){putchar('0');puts("");return;} while(x>0)CH[++Num]=x%10,x/=10; while(Num)putchar(CH[Num--]+48); puts(""); } struct node { int l,r,mx; }; node a[maxn*4]; int h,w,n; void build(int x,int l,int r) { a[x].l=l,a[x].r=r; a[x].mx=w; if(l==r) return; int mid=(l+r)>>1; build(x<<1,l,mid); build(x<<1|1,mid+1,r); } int update(int x,int val) { int l=a[x].l,r=a[x].r; if(l==r) { a[x].mx-=val; return l; } else { int ans=0; if(a[x<<1].mx>=val) ans=update(x<<1,val); else ans=update(x<<1|1,val); a[x].mx=max(a[x<<1].mx,a[x<<1|1].mx); return ans; } } int d; int main() { while(scanf("%d%d%d",&h,&w,&n)!=EOF) { memset(a,0,sizeof(a)); build(1,1,min(h,maxn)); for(int i=0;i<n;i++) { d=read(); if(a[1].mx<d) puts("-1"); else printf("%d\n",update(1,d)); } } }
相关文章推荐
- hdu 2795 Billboard(线段树之 单点更新+区间最值)
- HDU 2795 Billboard [线段树-单点更新]
- hdu 2795 Billboard(线段树单点更新)
- HDU - 2795 Billboard(线段树,单点更新,最值问题)
- HDU 2795 (线段树 单点更新) Billboard
- HDU - 2795 Billboard(线段树 单点更新 最值问题)
- hdu 2795 Billboard(线段树+单点更新)
- HDU 2795 Billboard(线段树区间最值查询和单点更新)
- 线段树练习[单点更新] HDU 2795 Billboard
- HDU 2795 Billboard【线段树】单点查找更新
- 线段树单点更新 hdu 2795 Billboard
- hdu 2795 Billboard线段树运用(单点更新)
- 线段树 单点更新查询 区间最大值 hdu 2795 Billboard
- hdu 2795 Billboard 线段树 单点更新
- hdu 2795 Billboard (线段树,单点更新)
- HDU2795 Billboard 【线段树】+【单点更新】
- hdu 2795 Billboard(线段树-单点更新)
- hdu 2795 Billboard 线段树 单点更新
- hdu 2795 Billboard 线段树 单点更新
- hdu 2795 Billboard 线段树单点更新(线段树+二分)