高精度加法:
vector<int>add(vector<int>&a,vector<int>&b)
{
vector<int>c;
int t=0;//表示进位
for(int i = 0;i <= a.size()-1||i <= b.size()-1; i++ )
{
if(i<a.size())t+=a[i];
if(i<b.size())t+=b[i];
c.push_back(t%10);
t/=10;
}
if(t)c.push_back(1);
return c;
}
高精度减法:
注意:该模板默认A>B,对于A,B,自行判断大小:
判断模板:
bool cmp(vector<int>&a,vector<int>&b)
{
if(a.size()!=b.size())return a.size()>b.size();
else
{
for(int i=a.size()-1;i>=0;i--)
{
if(a[i]!=b[i])return a[i]>b[i];
}
}
return true;
}
// C = A - B, 满足A >= B, A >= 0, B >= 0
vector<int> sub(vector<int> &A, vector<int> &B)
{
vector<int> C;
for (int i = 0, t = 0; i < A.size(); i ++ )
{
t = A[i] - t;
if (i < B.size()) t -= B[i];
C.push_back((t + 10) % 10);
if (t < 0) t = 1;
else t = 0;
}
while (C.size() > 1 && C.back() == 0) C.pop_back();
return C;
}
高精度乘法:
// C = A * b, A >= 0, b >= 0
vector<int> mul(vector<int> &A, int b)
{
vector<int> C;
int t = 0;
for (int i = 0; i < A.size() || t; i ++ )
{
if (i < A.size()) t += A[i] * b;
C.push_back(t % 10);
t /= 10;
}
while (C.size() > 1 && C.back() == 0) C.pop_back();
return C;
}
高精度除法:
// A / b = C ... r, A >= 0, b > 0
vector<int> div(vector<int> &A, int b, int &r)
{
vector<int> C;
r = 0;
for (int i = A.size() - 1; i >= 0; i -- )
{
r = r * 10 + A[i];
C.push_back(r / b);
r %= b;
}
reverse(C.begin(), C.end());
while (C.size() > 1 && C.back() == 0) C.pop_back();
return C;
}
一维前缀和:
S[i] = a[1] + a[2] + ... a[i]//预处理
a[l] + ... + a[r] = S[r] - S[l - 1]//区间和的计算
二维前缀和:
S[i, j] = 第i行j列格子左上部分所有元素的和
以(x1, y1)为左上角,(x2, y2)为右下角的子矩阵的和为:
S[x2, y2] - S[x1 - 1, y2] - S[x2, y1 - 1] + S[x1 - 1, y1 - 1]
预处理:
s[i][j]=s[i-1][j]+s[i][j-1]+a[i][j]-s[i-1][j-1];
一维差分:
给区间[l, r]中的每个数加上c:B[l] += c, B[r + 1] -= c
二维差分:
给以(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
预处理:
void insert(int x1,int y1,int x2,int y2, int c)
{
b[x1][y1]+=c;
b[x1][y2+1]-=c;
b[x2+1][y1]-=c;
b[x2+1][y2+1]+=c;
}