hdu2795Billboard (线段树,看作点更新)
来源:互联网 发布:mysql事务select 编辑:程序博客网 时间:2024/05/16 14:17
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.
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 524333
Sample Output
1213-1
#include<stdio.h>#define N 200005int tree[4*N];int max(int a,int b){return a>b?a:b;}int min(int a,int b){return a<b?a:b;}void builde(int l,int r,int k,int w){ int m=(l+r)/2; tree[k]=w; if(l==r) return ; builde(l,m,k*2,w); builde(m+1,r,k*2+1,w);}int loc;void updata(int l,int r,int k,int tw){ int m=(l+r)/2; if(l==r&&tree[k]>=tw) {loc=l;tree[k]-=tw;return ;} if(tree[k*2]>=tw) updata(l,m,k*2,tw); else if(tree[k*2+1]>=tw) updata(m+1,r,k*2+1,tw); tree[k]=max(tree[k*2],tree[k*2+1]);}int main(){ int h,w,n,m; while(scanf("%d%d%d",&h,&w,&m)>0) { n=min(h,m); builde(1,n,1,w); while(m--) { loc=-1; scanf("%d",&w); updata(1,n,1,w); printf("%d\n",loc); } }}
- hdu2795Billboard (线段树,看作点更新)
- HDU2795Billboard--线段树单点更新
- hdu2795Billboard(线段树)
- 线段树-HDU2795Billboard
- hdu2795Billboard 线段树
- hdu2795Billboard【线段树】
- hdu2795Billboard(线段树)
- HDU2795Billboard (线段树)
- hdu2795Billboard(线段树,找第一个大于w的点)
- 线段树 点更新
- 线段树点更新poj2828
- hdu3874(线段树点更新)
- 线段树,点更新查找
- 线段树,点更新查找
- 线段树 点更新和段更新
- 线段树更新区间查找点
- UESTC 1558 线段树点更新
- hdu4288 线段树之点更新
- 字母旋转游戏
- Linux_Bash指令_命令行参数
- NineOldAndroidsDemos 学习(1) Toggles
- 1.9 GridView: 将GridView中布局填充到界面中
- MySQL的日常管理
- hdu2795Billboard (线段树,看作点更新)
- android错误之android.util.AndroidRuntimeException: You cannot combine custom titles with other title
- Eclipse工程部署
- iOS UITableView 简单应用中的两个实现函数
- 1.10 状态选择器: 就是一个xml配置文件
- ODBC连接类函数
- Maximum path sum I Problem 18
- complex network1
- beautifulsoup的简单用法