暑期留校——6月21日算法学习

差分：

 本题的代码：

#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(){cin>>n>>m;for(int i = 1;i <= n; i ++ ) cin>>a[i];for(int i = 1; i <= n; 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 ++ ) b[i] += b[i - 1];for(int i = 1; i <= n; i ++ ) cout<<b[i]<<" ";return 0;}

差分模板：

给区间[l, r]中的每个数加上c：B[l] += c, B[r + 1] -= c

差分矩阵

本题代码： 

#include<iostream>

using namespace std;

const int N = 1010;

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

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;
}
 int main()
{
     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 ++ )      
        insert(i, j, i, j,a[i][j]);     
        
       while(q -- )  
     {   
        int x1, y1, x2, y2, c;  
       cin >> x1 >> y1 >> x2 >> y2 >> c; 
         insert(x1, y1,x2, y2,c); 
     }     
   
     for(int i = 0;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;
} 

 模板：

​
给以(x1, y1)为左上角，
(x2, y2)为右下角的子矩阵中的所有元素加上c：
S[x1, y1] += c, S[x2 + 1, y1] -= c, S[x1, y2 + 1] -= c, S[x2 + 1, y2 + 1] += c

​

今天还打了一场比赛，明天开始补题。