前缀和、差分模板

最新推荐文章于 2023-04-05 18:03:08 发布

天才少年伊泽瑞尔

最新推荐文章于 2023-04-05 18:03:08 发布

阅读量164

点赞数

分类专栏： ACM steps 文章标签： c++ 算法数据结构

本文链接：https://blog.csdn.net/zhao_xin_ran/article/details/128394634

版权

ACM steps 专栏收录该内容

27 篇文章 0 订阅

订阅专栏

前缀和和差分互为逆过程

它们的意义在于把 $O(n)$ 的时间复杂度降为 $O(1)$ ；

前缀和是把区间求和操作降至 $O(1)$

差分是把区间修改操作降至 $O(1)$

一维前缀和与差分

//前缀和

#include <bits/stdc++.h>
#define int long long
#define io ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define endl '\n'
using namespace std;
const int N = 1e5 + 5;
int n, m;
int l, r;
int a[N];
int s[N];

signed main()
{
    io;
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
    }
    for (int i = 1; i <= n; i++)
    {
        s[i] = s[i - 1] + a[i];
    }
    while (m--)
    {
        cin >> l >> r;
        cout<<s[r]-s[l-1]<<endl;
    }
}

//差分

#include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define io ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
const int N=1e5+5;
int n,m;
int a[N],b[N];

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

signed main()
{
    io;
    cin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        insert(i,i,a[i]);
    }
    while(m--)
    {
        int l,r,c;
        cin>>l>>r>>c;
        insert(l,r,c);
    }
    for(int i=1;i<=n;i++)
    {
        a[i]=b[i]+a[i-1];
        cout<<a[i]<<' ';
    }
    cout<<endl;
}

二维前缀和与差分

//二维前缀和，子矩阵的和

#include <bits/stdc++.h>
#define io ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define endl '\n'
#define int long long 
using namespace std;
int n, m, q;
const int N = 1005;
int a[N][N], s[N][N];

signed main()
{
    io;
    cin >> n >> m >> q;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            cin >> a[i][j];
        }
    }

    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            s[i][j] = a[i][j] + s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1];
        }
    }

    while (q--)
    {
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        cout << (s[x2][y2] - s[x1 - 1][y2] - s[x2][y1 - 1] + s[x1 - 1][y1 - 1]) << endl;
    }
}

//差分矩阵

#include <bits/stdc++.h>
#define endl '\n'
#define int long long
#define io ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
using namespace std;
const int N = 1005;
int a[N][N], b[N][N];
int n, m, q;

void insert(int x1, int y1, int x2, int y2, int c)
{
    b[x1][y1] += c;
    b[x2 + 1][y1] -= c;
    b[x1][y2 + 1] -= c;
    b[x2 + 1][y2 + 1] += c;
}

signed main()
{
    io;

    cin >> n >> m >> q;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
        {
            cin >> a[i][j];
            insert(i, j, i, j, a[i][j]);
        }
    while (q--)
    {
        int x1, x2, y1, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        int c;
        cin >> c;
        insert(x1, y1, x2, y2, c);
    }

    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            a[i][j] = b[i][j] + a[i - 1][j] + a[i][j - 1] - a[i - 1][j - 1];
            cout << a[i][j] << ' ';
        }
        cout<<endl;
    }

    return 0;
}