HDU 2795 线段树单点更新

Billboard

Time Limit: 20000/8000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 23498    Accepted Submission(s): 9687

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 <= 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

 

再次温习一下线段树，这道题算是较简单的线段树了吧。

这个题目意思就是给出h个大小初始为w的数这些数大小一样但有各自的顺序，接着进行n次询问，每次要从这些数找到一个不小于询问值得数，且这个数尽量排在前面，如果没有找到输出-1，如果找到就让这个数更新为此数减去询问值后的值。

暴力寻找得话会T，考虑适当的数据结构来简化操作。

进一步的思考时候发现，如果一段区间分为两部分只要前面部分的最大值>=询问值，我们就不必考虑后面部分的数了，由此想到使用线段树，维护一个区间最大值即可。由于更新和查找都是log级别不会T。

还有一点就是这个最大的区间并不一定是[1,H]，H最大1e9，不可能开出这个多空间保存节点，我们注意到N最大就是20w，由于要尽可能的将可以放置的数放在前面，

所以最大也就占用20w行，换句话说R最小的最大区间应是 [1,min(H,N)];这里的区间[l,r]指的是从l行到r行，所以maxn[i]就是第i个节点对应的所有行中剩余的最大宽度。

还是不太熟练犯了许多小错误，例如将结点值与L,R搞混。

 #include<bits/stdc++.h>
 using namespace std;
 int maxn[(<<)+];
 int H,N,W,X;
 void build()
 {
  int M=X<<;
  for(int i=;i<=M;++i) maxn[i]=W;
 }
 void update(int L,int R,int id,int tar,int x)
 {
    int m=(L+R)>>,lc=id<<,rc=(id<<)|;
    if(L==R&&L==tar) {maxn[id]=x;return;}
    if(tar<=m){
      update(L,m,lc,tar,x);
    }
    else{
     update(m+,R,rc,tar,x);
    }
    maxn[id]=max(maxn[lc],maxn[rc]);
 }
 int ask(int L,int R,int id,int x)
 {
     if(maxn[id]<x) return -;
     if(L==R) {update(,X,,L,maxn[id]-x);return L;}
     int m=(L+R)>>,lc=id<<,rc=(id<<)|;
     if(maxn[lc]>=x){
         return ask(L,m,lc,x);
     }
     else{
         return ask(m+,R,rc,x);
     }
 }
 int main()
 {
     int i,j,k,wi;
     while(cin>>H>>W>>N){X=min(H,N);
         build();
         for(i=;i<=N;++i){
             scanf("%d",&wi);
             printf("%d\n",ask(,X,,wi));
         }
     }
     return ;
 }