HDU 1556 Color the ball 线段树更新区间查点

点击打开链接

Color the ball

Time Limit: 9000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 9120    Accepted Submission(s): 4665

Problem Description

N个气球排成一排，从左到右依次编号为1,2,3....N.每次给定2个整数a b(a <= b),lele便为骑上他的“小飞鸽"牌电动车从气球a开始到气球b依次给每个气球涂一次颜色。但是N次以后lele已经忘记了第I个气球已经涂过几次颜色了，你能帮他算出每个气球被涂过几次颜色吗？

 

Input

每个测试实例第一行为一个整数N,(N <= 100000).接下来的N行，每行包括2个整数a b(1 <= a <= b <= N)。
当N = 0，输入结束。

 

Output

每个测试实例输出一行，包括N个整数，第I个数代表第I个气球总共被涂色的次数。

 

Sample Input

   
   

    
    3
1 1
2 2
3 3
3
1 1
1 2
1 3
0
   
   

 

Sample Output

   
   

    
    1 1 1
3 2 1
   
   

 

Author

8600

 

//734MS	4340K
#include<stdio.h>
struct Tree
{
    int l,r,mid,num;
}tree[300007];
int count;
void build(int left,int right,int i)
{
    tree[i].l=left;tree[i].r=right;tree[i].num=0;
    tree[i].mid=(left+right)>>1;
    if(left==right)return;
    build(left,tree[i].mid,2*i);
    build(tree[i].mid+1,right,2*i+1);
}
void insert(int left,int right,int i)
{
    if(tree[i].l==left&&tree[i].r==right){tree[i].num++;return;}
    if(tree[i].mid<left)insert(left,right,2*i+1);
    else if(tree[i].mid>=right)insert(left,right,2*i);
    else
    {
        insert(left,tree[i].mid,2*i);
        insert(tree[i].mid+1,right,2*i+1);
    }
}
void search(int id,int i)
{
    count+=tree[i].num;
    if(tree[i].l==tree[i].r&&tree[i].l==id)return;
    if(tree[i].mid>=id)search(id,i*2);
    else search(id,i*2+1);
}
int main()
{
    int n,a,b;
    while(scanf("%d",&n),n)
    {
        build(1,n,1);
        for(int i=1;i<=n;i++)
        {
            scanf("%d%d",&a,&b);
            insert(a,b,1);
        }
        for(int i=1;i<n;i++)
        {
            count=0;
            search(i,1);
            printf("%d ",count);
        }
        count=0;
        search(n,1);
        printf("%d\n",count);
    }
    return 0;
}