前缀和+差分

1.前缀和

(1)一维前缀和

                

①题目示例1

                 

#include<iostream>
#include<vector>

using namespace std;


int main()
{
    int n,m;
    cin >> n >> m;
    
    vector<int> a(n+1,0);
    vector<int> s(n+1,0);
    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--)
    {
        int l,r;
        cin >> l >> r;
        cout << s[r] - s[l-1] << endl;
    }
    
        

    return 0;
}

                 

②题目示例2 

         

                 

class Solution {
public:
    int minSubArrayLen(int target, vector<int>& nums) 
    {
      int n = nums.size();
      vector<int> s(n+1,0);

      for(int i = 1 ; i <= n ;++i)
      {
          s[i] = s[i-1] + nums[i-1];
      }
      
      if(s[n] < target)
      return 0;

      int res = INT_MAX;
     for(int i = 1 ; i <= n ; ++i)
     {
         int temp = s[i] - target; //确定一条边界
         
         int l = 0;
         int r = i;
         while(l < r) //二分找符合要求的位置
         {
             int mid = (l + r + 1) >> 1;
             if(s[mid] <= temp) l = mid; //往
             else r = mid-1;
         }
         
         if(s[l] > temp) continue; //位置不符合

         res = min(res,i-l);
     }

     return res;
    }
};

                                        

(2)二维前缀和

                 

①题目示例1

                 

#include<iostream>
#include<vector>

using namespace std;


int main()
{
    ios::sync_with_stdio(false);
    int n,m,q;
    cin >> n >> m >> q;
    
    vector<vector<int>> a(n+1,vector<int>(m+1,0));
    for(int i = 1 ; i <= n ;++i)
    {
        for(int j = 1; j <= m;++j)
        {
            cin >> a[i][j]; //数组存数据
        }
    }
    
    vector<vector<int>> s(n+1,vector<int>(m+1,0));
    for(int i = 1 ; i <= n ;++i)
    {
        for(int j = 1; j <= m;++j)
        {
            s[i][j] = s[i-1][j]+s[i][j-1]-s[i-1][j-1]+a[i][j]; //构造前缀和s[i][j]
        }
    }
    
    while(q--)
    {
        int x1,y1;
        int 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;
    }
    
    return 0;
}

                

                                

2.差分

(1)一维差分

                

 ①代码示例1

                                 

#include<iostream>
#include<vector>

using namespace std;

void Insert(vector<int>& b ,int l, int r, int num) //构造b，最后构造最终结果也能用
{
    b[l] += num;
    b[r+1] -= num;
}


int main()
{
    int n , m;
    cin >> n >> m;
    
    vector<int> a(n+1,0);
    for(int i = 1 ; i <= n;++i)  cin >> a[i];

    vector<int> b(n+1,0);
    for(int i = 1 ; i <= n;++i) Insert(b,i,i,a[i]);
    
    while(m--)
    {
        int l,r,c;
        cin >> l >> r >> c ;
        Insert(b,l,r,c);
    }
    
    for(int i = 1 ; i <= n;++i) b[i] += b[i-1];  //得到最终的a数组
    for(int i = 1 ; i <= n;++i) cout << b[i] << " ";
    
    return 0;
}

                         

(2)二维差分

        

#include<iostream>
#include<vector>

using namespace std;

void Insert(vector<vector<int>>& b, 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;
}

int main()
{
    int n,m,q;
    cin >> n >> m >> q;
    
    vector<vector<int>> a(n+2,vector<int>(m+2,0));
    for(int i = 1 ; i <= n;++i)
    {
        for(int j = 1; j <= m;++j)
        {
            cin >> a[i][j];
        }
    }

    vector<vector<int>> b(n+2,vector<int>(m+2,0));
    for(int i = 1 ; i <= n;++i)
    {
        for(int j = 1; j <= m;++j)
        {
            Insert(b,i,j,i,j,a[i][j]);
        }
    }

    while(q--)
    {
        int x1,y1;
        int x2,y2;
        int c;
        cin >> x1 >> y1 >> x2 >> y2 >> c;
        Insert(b,x1,y1,x2,y2,c);
    }

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

    for(int i = 1 ; i <= n;++i)
    {
        for(int j = 1; j <= m;++j)
        {
           cout << b[i][j] << " ";
        }
        cout << endl;
    }
    
    return 0;
}