Billboard+线段树
来源:互联网 发布:软件开发费用组成 编辑:程序博客网 时间:2024/05/23 17:55
Billboard
Time Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6491 Accepted Submission(s): 2937
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/*思路:以高度为区间,以宽度为值,进行构建线段树一个优化点,if(h>n) h=n;*/#include<iostream>#include<cstdio>using namespace std;#define MAX 200000typedef struct infor {int left , right , value ;}infor ; infor tree[4*MAX] ;int max(int a, int b){return a>b?a:b;}void create(int root , int left , int right , int value ){tree[root].left = left ; tree[root].right = right ;tree[root].value = value ;if( left == right )return ;int mid = (left + right ) / 2 ;create(root*2 , left , mid , value );create(root*2 + 1 , mid + 1 , right ,value );}int ans ;int cal(int root , int left , int right , int value ){if(tree[root].value < value )return 0;if(tree[root].left == tree[root].right ){if(tree[root].value >= value){tree[root].value -= value ;ans = tree[root].left ;return tree[root].value ;}}int mid = (tree[root].left + tree[root].right ) / 2; if(tree[root*2].value >= value)return tree[root].value = max(cal(root*2 , left , mid , value),tree[root*2 + 1].value ) ;elsereturn tree[root].value = max(cal(root*2 + 1 , mid + 1 , right , value ),tree[root*2].value ) ;}int main( void ){int h , w , q ;while(scanf("%d %d %d",&h,&w,&q)!=EOF){if(h > q )h = q ;int i ;create( 1, 1 , h , w);for( i = 0 ; i < q ; i ++){int len;ans = -1 ;//cin >> len ;scanf("%d",&len);cal(1,1,h,len);//cout<<ans<<endl;printf("%d\n",ans);}}return 0 ; }
- Billboard(线段树)
- HDU2795(Billboard)线段树
- Billboard+线段树
- HDU2795 Billboard(线段树)
- hdu2795 Billboard 线段树
- Billboard(线段树)
- Billboard(线段树)
- 【hdu】Billboard(线段树)
- HDU2795 Billboard(线段树)
- Billboard(线段树)
- hdu2795 Billboard(线段树)
- HDOJ2795 Billboard(线段树)
- HDU2795 Billboard 线段树
- HDU_2795 Billboard(线段树)
- HDU2795 Billboard 线段树
- hdu2795 Billboard 线段树
- HDU2795-Billboard 【线段树】
- Billboard(线段树)
- 黑马程序员_网络编程(UDP协议与TCP协议)
- Vector二维数组实现
- struts2中数组或List的使用
- 基础入门博客一览(无法直接转载)
- NetBSD 6.0.1 发布,开源UNIX操作系统
- Billboard+线段树
- HDU 1728 解题报告 ---- 逃离迷宫
- 关于LINUX的文件锁的一些心得
- java开发环境的建立
- com.opensymphony.module.sitemesh.filter.pagefilter的作用
- rqnoj - 167 - Show Problem(LIS)
- 使用swig进行C/C++对Python的扩展
- 我看亨德利和奥沙利文(比较客观)
- hdu 1978