AcWing 797. 差分

---

一、题目链接

AcWing 797. 差分

---

二、题目分析

（一）算法标签

差分

（二）解题思路

1. 构建差分数组的两种方式
   1. 定义法

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

   2. 借助insert()

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

   insert():

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

2. 由差分数组求原数组的两种方式
   1. 定义法

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

   2. 求前缀和

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

三、AC代码

解法一:

#include <iostream>

using namespace std;

const int N = 1e5 + 10;

int n, m, l, r, c;

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]);
        insert(i, i, a[i]);
    }
    while (m --) {
        scanf("%d%d%d", &l, &r, &c);
        insert(l, r, c);
    }
    for (int i = 1; i <= n; i ++ ) {
        b[i] += b[i - 1];
        printf("%d ", b[i]);
    }
    return 0;
}

---

四、其它题解

AcWing 797. 差分