一维差分--差分数组构造的两种方法详解版

最新推荐文章于 2024-05-20 20:08:58 发布

>爱码仕<

最新推荐文章于 2024-05-20 20:08:58 发布

阅读量266

点赞数 14

文章标签：算法蓝桥杯

本文链接：https://blog.csdn.net/m0_66163419/article/details/137068892

版权

题目链接：797. 差分 - AcWing题库

构造方法一：数组b自身满足b[i]=a[i]-a[i-1]，无需再构造

#include <iostream>

using namespace std;

const int N = 100010;

int n, m;
int a[N], b[N];

void insert(int l, int r, int c)
{
    b[l] += c;
    b[r + 1] -= c;
}

int main()
{
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i ++ ) scanf("%d", &a[i]);

    for (int i = 1; i <= n; i ++ ) insert(i, i, a[i]);

    while (m -- )
    {
        int l, r, c;
        scanf("%d%d%d", &l, &r, &c);
        insert(l, r, c);
    }

    for (int i = 1; i <= n; i ++ ) b[i] += b[i - 1];

    for (int i = 1; i <= n; i ++ ) printf("%d ", b[i]);

    return 0;
}

思路：

假定a数组最开始都是0，那么b数组初始时就是a数组的差分数组了,满足b[i]=a[i]-a[i-1]for (int i = 1; i <= n; i ) insert(i, i, a[i]);

然后在对于差分数组b从i到i的位置插入a[i]，则a[i]则从0加上a[i]之后等于输入的a[i]的值

a[1]~a[i-1]、a[i+1]~a[N]无影响

构造方法二：通过b[i]=a[i]-a[i-1]构造差分数组b

#include<iostream>
using namespace std;
const int N = 1e5 + 10;
int a[N],b[N]; 
int main()
{
    int n,m;
    scanf("%d%d", &n, &m);
    for(int i = 1;i <= n; i++) 
    {
        scanf("%d", &a[i]);
        b[i] = a[i] - a[i - 1];      //构建差分数组
    }
    int l, r, c;
    while(m--)
    {
        scanf("%d%d%d", &l, &r, &c);
        b[l] += c;     //表示将序列中[l, r]之间的每个数加上c
        b[r + 1] -= c;
    }
    for(int i = 1;i <= n; i++) 
    {
        b[i] += b[i - 1];  //求前缀和运算
        printf("%d ",b[i]);
    }
    return 0;
}