poj3468线段树_区间数字统计

最新推荐文章于 2021-11-15 22:13:06 发布

batilei

最新推荐文章于 2021-11-15 22:13:06 发布

阅读量1k

点赞数

分类专栏： Algorithm 文章标签： null c

本文链接：https://blog.csdn.net/tspatial_thunder/article/details/7463529

版权

Algorithm 专栏收录该内容

78 篇文章 0 订阅

订阅专栏

自从上次偶尔用了一次线段树后就很喜欢这东西，做各种区间统计挺有用的。抽空又玩了下3468。也是一道很常见的数段树应用，统计区间的和，有时候又要更新区间的值。

#include<iostream>

using namespace std;

class TreeNode
{
public:
int lIndex,rIndex;
TreeNode *lNode;
TreeNode *rNode;
__int64 inc;
__int64 sum;
};

//根据给定的数组建树
void BuildTree(TreeNode *tNode,int lIndex,int rIndex)
{
tNode->lIndex=lIndex;
tNode->rIndex=rIndex;
tNode->inc=0;

int midIndex=(lIndex+rIndex)/2;

if(midIndex<rIndex)
{
tNode->lNode=new TreeNode();
BuildTree(tNode->lNode,lIndex,midIndex);
}
if(midIndex+1>lIndex && midIndex+1<=rIndex)
{
tNode->rNode=new TreeNode();
BuildTree(tNode->rNode,midIndex+1,rIndex);
}
return ;
}

//初始化区间的和
__int64 InitTreeNodeSum(TreeNode *tnode,int arr[])
{
if(tnode==NULL)return 0;
if(tnode->lIndex==tnode->rIndex)
{
tnode->sum=arr[tnode->lIndex];

}

else
{
__int64 leftSum=InitTreeNodeSum(tnode->lNode,arr);
__int64 rightSum=InitTreeNodeSum(tnode->rNode,arr);
tnode->sum=leftSum+rightSum;
}
return tnode->sum;
}

//增加操作
void AddSubSequence(TreeNode *tNode,int lIndex,int rIndex,int tInc)
{
if(lIndex==tNode->lIndex && rIndex==tNode->rIndex)
{
tNode->inc+=tInc;
return;
}

else
{
tNode->sum += (rIndex-lIndex+1)*tInc;

if(rIndex <= tNode->lNode->rIndex)//totally in the left child
{
AddSubSequence(tNode->lNode,lIndex,rIndex,tInc);
}

else if(lIndex >= tNode->rNode->lIndex)//totally in the right child
{
AddSubSequence(tNode->rNode,lIndex,rIndex,tInc);
}

else
{
AddSubSequence(tNode->lNode,lIndex,tNode->lNode->rIndex,tInc);
AddSubSequence(tNode->rNode,tNode->rNode->lIndex,rIndex,tInc);
}
}
}

//询问操作
__int64 QuerySequence(TreeNode *tNode,int lIndex,int rIndex,int parentInc)
{
if(tNode->lIndex==lIndex && tNode->rIndex==rIndex)
{
__int64 sum = tNode->sum+(tNode->rIndex-tNode->lIndex+1)*(tNode->inc+parentInc);
return sum;
}
else
{
if(rIndex <= tNode->lNode->rIndex)//totally in the left child
{
return QuerySequence(tNode->lNode,lIndex,rIndex,tNode->inc+parentInc);
}

else if(lIndex >= tNode->rNode->lIndex)//totally in the right child
{
return QuerySequence(tNode->rNode,lIndex,rIndex,tNode->inc+parentInc);
}

else
{
return QuerySequence(tNode->lNode,lIndex,tNode->lNode->rIndex,tNode->inc+parentInc) +
QuerySequence(tNode->rNode,tNode->rNode->lIndex,rIndex,tNode->inc+parentInc);
}
}
}

int main()
{
int N,Q;
int inArray[100001];
scanf("%d%d",&N,&Q);
for(int i=1;i<=N;i++)
{
scanf("%d",&inArray[i]);
}

TreeNode treeRoot;
BuildTree(&treeRoot,1,N);

InitTreeNodeSum(&treeRoot,inArray);

for (int i=0;i<Q;i++)
{
char ch=' ';
int a,b,c;
while(!(ch == 'Q' || ch=='C'))
scanf("%c",&ch);
if(ch=='Q')
{
scanf("%d%d",&a,&b);
__int64 sum=QuerySequence(&treeRoot,a,b,0);
printf("%lld\n",sum);
}
else
{
scanf("%d%d%d",&a,&b,&c);
AddSubSequence(&treeRoot,a,b,c);
}
}
return 0;
}