hdu 4107 Gangster 线段树成段更新最后求每一位的值

最新推荐文章于 2020-07-07 19:40:15 发布

kongming_acm

最新推荐文章于 2020-07-07 19:40:15 发布

阅读量801

点赞数

分类专栏： acm_数据结构文章标签： tree each query numbers input output

本文链接：https://blog.csdn.net/kongming_acm/article/details/6922987

版权

acm_数据结构专栏收录该内容

112 篇文章 1 订阅

订阅专栏

Problem Description

There are two groups of gangsters fighting with each other. The first group stands in a line, but the other group has a magic gun that can shoot a range [a, b], and everyone in that range will take a damage of c points. When a gangster is taking damage, if he has already taken at least P point of damage, then the damage will be doubled. You are required to calculate the damage that each gangster in the first group toke.
To simplify the problem, you are given an array A of length N and a magic number P. Initially, all the elements in this array are 0.
Now, you have to perform a sequence of operation. Each operation is represented as (a, b, c), which means: For each A[i] (a <= i <= b), if A[i] < P, then A[i] will be A[i] + c, else A[i] will be A[i] + c * 2.
Compute all the elements in this array when all the operations finish.

Input

The input consists several testcases.
The first line contains three integers n, m, P (1 <= n, m, P <= 200000), denoting the size of the array, the number of operations and the magic number.
Next m lines represent the operations. Each operation consists of three integers a; b and c (1 <= a <= b <= n, 1 <= c <= 20).

Output

Print A[1] to A[n] in one line. All the numbers are separated by a space.

Sample Input

Sample Output

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct Node
{
    int left,right;
    int _max,_min,lnc;//当前区间的最大值和最小值,当前区间需要加上的数(区间)
};
int n,m,p;
const int maxn=200000;
Node tree[maxn*4];
void buildtree(int id,int l,int r)
{
    tree[id].left=l,tree[id].right=r;
    tree[id]._max=tree[id]._min=tree[id].lnc=0;
    if(l!=r)
    {
        int mid=(l+r)>>1;
        buildtree(id<<1,l,mid);
        buildtree(id<<1|1,mid+1,r);
    }
}
void update(int id,int l,int r,int d)
{
    if(tree[id].left==l&&tree[id].right==r)
    {
        if(tree[id]._max<p)
        {
            tree[id].lnc+=d;
            tree[id]._max+=d;
            tree[id]._min+=d;
            return ;
        }
        if(tree[id]._min>=p)
        {
            tree[id].lnc+=d<<1;
            tree[id]._max+=d<<1;
            tree[id]._min+=d<<1;
            return ;
        }
    }
    if(tree[id].lnc)
    {
        tree[id<<1].lnc+=tree[id].lnc;
        tree[id<<1]._max+=tree[id].lnc;
        tree[id<<1]._min+=tree[id].lnc;
        tree[id<<1|1].lnc+=tree[id].lnc;
        tree[id<<1|1]._max+=tree[id].lnc;
        tree[id<<1|1]._min+=tree[id].lnc;
        tree[id].lnc=0;
    }
    int mid=(tree[id].left+tree[id].right)>>1;
    if(r<=mid) update(id<<1,l,r,d);
    else if(l>=mid+1) update(id<<1|1,l,r,d);
    else
    {
        update(id<<1,l,mid,d);
        update(id<<1|1,mid+1,r,d);
    }
    tree[id]._max=max(tree[id<<1]._max,tree[id<<1|1]._max);
    tree[id]._min=min(tree[id<<1]._min,tree[id<<1|1]._min);
}
int a[maxn];
void query(int id)
{
    if(tree[id].left==tree[id].right)
    {
        a[tree[id].left]=tree[id].lnc;
        return ;
    }
    if(tree[id].lnc)
    {
        tree[id<<1].lnc+=tree[id].lnc;
        tree[id<<1|1].lnc+=tree[id].lnc;
        tree[id].lnc=0;
    }
    query(id<<1);
    query(id<<1|1);
}
int main()
{
    while(scanf("%d%d%d",&n,&m,&p)==3)
    {
        buildtree(1,1,n);
        while(m--)
        {
            int s,t,d;scanf("%d%d%d",&s,&t,&d);
            update(1,s,t,d);
        }
        query(1);
        printf("%d",a[1]);
        for(int i=2;i<=n;i++) printf(" %d",a[i]);printf("\n");
    }
    return 0;
}