luogu P1438 无聊的数列(线段树+差分)
题意:
对于一个数组 a [ ] a[] a[],现在有两个操作:
- 给定一个长度为 r − l + 1 r- l + 1 r−l+1 的的等差数列,首项为 K K K,公差为 D D D ,分别对应加到区间 [ l , r ] [l,r] [l,r] 上,即 a l = a l + K , a l + 1 = a l + 1 + K + D , ⋯ , a r = a r + K + ( r − l ) ∗ D a_l = a_l + K, a_{l+1} = a_{l+1} + K+D, \cdots,a_r = a_r + K + (r - l) * D al=al+K,al+1=al+1+K+D,⋯,ar=ar+K+(r−l)∗D
- 查询数组 a [ ] a[] a[] 上的第 p p p 个数值,即 a p a_p ap
思路: 操作一:因为对于一个区间 [ l , r ] [l,r] [l,r], 在第 l l l 位上加上 K K K ,在区间 ( l , r ] (l, r] (l,r] 上加上 D D D ,再在第 r + 1 r+1 r+1 位上加上 − ( K + ( r − l ) ∗ D ) -(K + (r - l) * D) −(K+(r−l)∗D) 。这样对于数组每一位上的修改就是对应的区间 [ 1 , i ] [1,i] [1,i] 的前缀和,再加上数组原来的值就是答案。
代码:
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<stack>
#include<cmath>
#include<map>
#include<set>
#include<cstring>
#include<string>
#include<algorithm>
#define fi first
#define se second
//#include<stdlib.h>
//#include <time.h>
//srand((unsigned)time(NULL));
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int INF = 0x3f3f3f3f;
using namespace std;
const int N = 2e6 + 10;
int a[N];
int n, m;
#define ls (rt << 1)
#define rs ((rt << 1) | 1)
int tr[N], lz[N];
void build(int l,int r, int rt) {
tr[rt] = 0; lz[rt] = 0;
if (l == r) {
tr[rt] = 0;
return;
}
int mid = (l + r) >> 1;
build(l, mid, ls);
build(mid + 1, r, rs);
tr[rt] = tr[ls] + tr[rs];
}
void pushdown(int l, int r, int rt) {
if (lz[rt] != 0) {
int mid = (l + r) >> 1;
tr[ls] += (mid - l + 1) * lz[rt];
tr[rs] += (r - mid) * lz[rt];
lz[ls] += lz[rt];
lz[rs] += lz[rt];
lz[rt] = 0;
}
}
int query(int s, int t, int l, int r, int rt) {
if (s <= l && r <= t) return tr[rt];
pushdown(l, r, rt);
int ans = 0;
int mid = (l + r) >> 1;
if (s <= mid) ans += query(s, t, l, mid, ls);
if (mid < t) ans += query(s, t, mid + 1, r, rs);
return ans;
}
void modify(int s, int t, int l, int r, int rt, int v) {
if (l > r) return;
if (s <= l && r <= t) {
tr[rt] += v * (r - l + 1);
lz[rt] += v;
return;
}
int mid = (l + r) >> 1;
pushdown(l, r, rt);
if (s <= mid) modify(s, t, l, mid, ls, v);
if (mid < t) modify(s, t, mid + 1, r, rs, v);
tr[rt] = tr[ls] + tr[rs];
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
build(1, n, 1);
while (m--) {
int opt;
scanf("%d", &opt);
if (opt == 1) {
int l, r, k, d;
scanf("%d%d%d%d", &l, &r, &k, &d);
modify(l, l, 1, n, 1, k);
modify(l + 1, r, 1, n, 1, d);
int vv = -1 * k - (r - l) * d;
if (r != n) modify(r + 1, r + 1, 1, n, 1, vv);
}
else if (opt == 2) {
int p;
scanf("%d", &p);
int change = query(1, p, 1, n, 1);
int ans = a[p] + change;
printf("%d\n", ans);
}
}
return 0;
}