BZOJ-3212 Pku3468 A Simple Problem with Integers 裸线段树区间维护查询
3212: Pku3468 A Simple Problem with Integers
Time Limit: 1 Sec Memory Limit: 128 MB
Submit: 1278 Solved: 560
[Submit][Status][Discuss]
Description
You have N integers, A1, A2, … , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given interval. The other is to ask for the sum of numbers in a given interval.
Input
The first line contains two numbers N and Q. 1 ≤ N,Q ≤ 100000.
The second line contains N numbers, the initial values of A1, A2, … , AN. -1000000000 ≤ Ai ≤ 1000000000.
Each of the next Q lines represents an operation.
“C a b c” means adding c to each of Aa, Aa+1, … , Ab. -10000 ≤ c ≤ 10000.
“Q a b” means querying the sum of Aa, Aa+1, … , Ab.
Output
You need to answer all Q commands in order. One answer in a line.
Sample Input
10 5
1 2 3 4 5 6 7 8 9 10
Q 4 4
Q 1 10
Q 2 4
C 3 6 3
Q 2 4
Sample Output
4
55
9
15
HINT
The sums may exceed the range of 32-bit integers.
题目大意:区间修改和区间查询
裸线段树毫无爆点
代码如下:
/**************************************************************
Problem: 3212
User: DaD3zZ
Language: C++
Result: Accepted
Time:48 ms
Memory:8304 kb
****************************************************************/
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define maxn 100001
long long sum[maxn<<2]={0},delta[maxn<<2]={0};
long long a[maxn]={0};
void updata(int now)
{
sum[now]=sum[now<<1]+sum[now<<1|1];
}
void build(int now,int l,int r)
{
if (l==r)
{
sum[now]=a[l];
return;
}
int mid=(l+r)>>1;
build(now<<1,l,mid);
build(now<<1|1,mid+1,r);
updata(now);
}
void pushdown(int now,int ln,int rn)
{
if (delta[now]!=0)
{
delta[now<<1]+=delta[now];
delta[now<<1|1]+=delta[now];
sum[now<<1]+=delta[now]*ln;
sum[now<<1|1]+=delta[now]*rn;
delta[now]=0;
}
}
void change(int L,int R,int now,int l,int r,long long data)
{
if (L<=l && R>=r)
{
sum[now]+=data*(r-l+1);
delta[now]+=data;
return;
}
int mid=(l+r)>>1;
pushdown(now,mid-l+1,r-mid);//这里需要先下放一波标记不然会出错
if (L<=mid)
change(L,R,now<<1,l,mid,data);
if (R>mid)
change(L,R,now<<1|1,mid+1,r,data);
updata(now);
}
long long query(int L,int R,int now,int l,int r)
{
if (L<=l && R>=r)
return sum[now];
int mid=(l+r)>>1;
pushdown(now,mid-l+1,r-mid);
long long total=0;
if (L<=mid)
total+=query(L,R,now<<1,l,mid);
if (R>mid)
total+=query(L,R,now<<1|1,mid+1,r);
return total;
}
int main()
{
int n,m;
scanf("%d%d",&n,&m);
for (int i=1; i<=n; i++)
scanf("%lld",&a[i]);
build(1,1,n);
for (int i=1; i<=m; i++)
{
char c[3];
int l,r;
scanf("%s",&c);
scanf("%d%d",&l,&r);
if (c[0]=='Q')
{
long long ans=query(l,r,1,1,n);
printf("%lld\n",ans);
}
else
{
long long data;
scanf("%lld",&data);
change(l,r,1,1,n,data);
}
}
return 0;
}
BZOJ-3212 Pku3468 A Simple Problem with Integers 裸线段树区间维护查询的更多相关文章
- bzoj 3212 Pku3468 A Simple Problem with Integers
3212: Pku3468 A Simple Problem with Integers Time Limit: 1 Sec Memory Limit: 128 MB Description You ...
- bzoj 3212 Pku3468 A Simple Problem with Integers 线段树基本操作
Pku3468 A Simple Problem with Integers Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 2173 Solved: ...
- 3212: Pku3468 A Simple Problem with Integers
3212: Pku3468 A Simple Problem with Integers Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 1053 So ...
- BZOJ3212: Pku3468 A Simple Problem with Integers(线段树)
3212: Pku3468 A Simple Problem with Integers Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 2530 So ...
- POJ.3468 A Simple Problem with Integers(线段树 区间更新 区间查询)
POJ.3468 A Simple Problem with Integers(线段树 区间更新 区间查询) 题意分析 注意一下懒惰标记,数据部分和更新时的数字都要是long long ,别的没什么大 ...
- POJ 3468 A Simple Problem with Integers(线段树/区间更新)
题目链接: 传送门 A Simple Problem with Integers Time Limit: 5000MS Memory Limit: 131072K Description Yo ...
- POJ 3468 A Simple Problem with Integers(线段树区间更新区间查询)
A Simple Problem with Integers Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 92632 ...
- poj 3468 A Simple Problem with Integers【线段树区间修改】
A Simple Problem with Integers Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 79137 ...
- [ACM] poj 3468 A Simple Problem with Integers(段树,为段更新,懒惰的标志)
A Simple Problem with Integers Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 55273 ...
随机推荐
- Tsung测试openfire服务器
环境准备 安装Tsung.安装openfire.安装Spark Tsung使用 要对openfire进行压力测试,因此我们主要讲解如何利用jabber_register.xml在openfire上面注 ...
- TestLink学习六:TestLink1.9.13工作使用小结
Testlink是一款强大的用例追踪和管理工具.测试管理注重的实际上就是一个流程. 1.默认当测试用例同名时,就会有提示.(以前版本需要修改配置) 2.测试用例序号:(缺点) 1)删除一个测试用例之后 ...
- a标签中有点击事件
我们常用的在a标签中有点击事件:1. a href="javascript:js_method();" 这是我们平台上常用的方法,但是这种方法在传递this等参数的时候很容易出问题 ...
- ArcGIS Engine 中 线加箭头
; ICartographicLineSymbol pCartoLineSymbol = ); IArrowMarkerSymbol p ...
- ArcGis实现添加MultiLayerMarkerSymbol(多个符号叠加生成新的符号)
, , ); pMarkerSymbol.Angle = ; pMarkerSymbol.XOffset = ;;;;, , ); ...
- 2666 Accept Ratio(打表AC)
2666 Accept Ratio 时间限制: 1 s 空间限制: 32000 KB 题目等级 : 钻石 Diamond 题解 查看运行结果 题目描述 Description 某陈痴迷 ...
- 06SpringMvc_适配器
适配器的主要功能是去找控制器.Action实现了什么接口 本文案例实现的功能是:在页面上输入中文名字,然后在另外一个网页上显示出来. 案例结构:
- 房产企业如何借助K2 BPM脱颖而出?
点击这里,查看完整版房地产行业的流程管理解决方案.
- Caffe学习系列(19): 绘制loss和accuracy曲线
如同前几篇的可视化,这里采用的也是jupyter notebook来进行曲线绘制. // In [1]: #加载必要的库 import numpy as np import matplotlib.py ...
- GSON
{ "data": [ { "children": [ { "id": 10007, "title": "北京 ...