分析:
首先题目明显的就是 区间修改 + 单点查询;
那么我们可以考虑转化为差分数组来解决。
把原数组变成差分数组,在 [l , r] 区间加上 [首项是x,公差是d,项数是r-l+1] 的等差数列:
<=> 在 l 处加上首项x,在 [l+1,r] 区间加上公差d,在 r+1 处减去前面的影响 ( x+(r-l)*d )
(自己手模一下就知道啦!)
注意:
1、当 r 为 n 时,r+1会超出线段树,记得特判;
2、注意这里维护的是差分数组,所以查询的时候是 1 ~ i
代码:
#include<iostream>
#include<queue>
#include<cstring>
#include<vector>
#include<stdio.h>
#include<map>
#include<algorithm>
#include<deque>
#include<stack>
#include<set>
// #include <unordered_map>
#include<math.h>
#include<string.h>
#define IOS ios::sync_with_stdio(false),cin.tie(0);
using namespace std;
#define pb push_back
#define coutl cout<<"------------"<<endl;
#define fi first
#define se second
#define ire(x) scanf("%d",&x)
#define iire(a,b) scanf("%d %d",&a,&b)
#define lre(x) scanf("%lld",&x)
#define llre(a,b) scanf("%lld %lld",&a,&b)
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define endl "\n"
#define PI acos(-1.0)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<double, int> PDI;
typedef pair<ll, ll> PLL;
typedef pair<double, double> PDD;
typedef pair<double, pair<int, double> > PDID;
typedef pair<char, char> PCC;
typedef pair<char, pair<int, int> > PCII;
typedef pair<int, pair<int, int> > PIII;
typedef pair<int, pair<int, pair<int, int> > > PIIII;
typedef pair<ll, pair<int, int> > PLII;
const int maxn = 3e5 + 7;
const int N = 1e6 + 7;
const int M = 1e6 + 7;
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double pi = acos(-1);
const double eps = 1e-8;
ll gcd(ll a,ll b) {return b==0 ? a : gcd(b,a%b);}
ll lcm(ll a,ll b) {return a*b / gcd(a,b);}
ll qmi(ll a,ll b,ll p) {ll ans = 1; while(b) { if(b & 1) ans = ans * a % p; a = a * a % p; b >>= 1; } return ans;}
int lowbit(int x) {return x & (-x);}
int n,m;
int a[maxn];
struct node
{
int l,r;
ll sum;
ll add; //懒标记
}tr[maxn * 4];
void pushup(int u)
{
tr[u].sum = tr[u<<1].sum + tr[u<<1|1].sum;
}
void pushdown(int u) //懒标记下传
{
if(tr[u].add)
{
tr[u<<1].add += tr[u].add;
tr[u<<1].sum += (ll)(tr[u<<1].r - tr[u<<1].l + 1) * tr[u].add;
tr[u<<1|1].add += tr[u].add;
tr[u<<1|1].sum += (ll)(tr[u<<1|1].r - tr[u<<1|1].l + 1) * tr[u].add;
tr[u].add = 0;
}
}
void build(int u,int l,int r) //建树
{
if(l == r)
{
tr[u] = {l,r,a[l],0};
return;
}
tr[u] = {l,r};
int mid = l + r >> 1;
build(u<<1, l, mid);
build(u<<1|1, mid+1, r);
pushup(u);
}
void update(int u,int l,int r,int v)
{
if(l > r) return;
if(tr[u].l >= l && tr[u].r <= r)
{
//注意add是没有包括自己区间的哦
tr[u].sum += (ll)(tr[u].r - tr[u].l + 1) * v;
tr[u].add += v;
return;
}
pushdown(u); //分裂了,下传懒标记
int mid = tr[u].l + tr[u].r >> 1;
if(l <= mid) update(u<<1, l, r, v);
if(r > mid) update(u<<1|1, l, r, v);
pushup(u); //向上更新
}
ll query(int u,int l,int r) //区间查询
{
if(tr[u].l >= l && tr[u].r <= r) return tr[u].sum;
pushdown(u); //分裂了,下传懒标记
int mid = tr[u].l + tr[u].r >> 1;
ll sum = 0;
if(l <= mid) sum += query(u<<1, l, r);
if(r > mid) sum += query(u<<1|1, l, r);
return sum;
}
int main()
{
iire(n,m);
for(int i=1;i<=n;i++) ire(a[i]);
for(int i=n;i>=1;i--) a[i] -= a[i-1];
build(1,1,n);
while(m--)
{
int op;
ire(op);
if(op == 1)
{
int l,r,k,d;
scanf("%d %d %d %d",&l,&r,&k,&d);
update(1,l,l,k);
update(1,l+1,r,d);
if(r+1 <= n) update(1,r+1,r+1,-k-(d*(r-l)));
}
else
{
int idx;
ire(idx);
cout<<query(1,1,idx)<<'\n';
}
}
return 0;
}