#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()
{
scanf("%d%d%d",&n,&m,&q);
for(int i = 1;i <= n;i++)
for(int j = 1;j <= m;j++)
scanf("%d",&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;
scanf("%d%d%d%d%d",&x1,&y1,&x2,&y2,&c);
insert(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 ++) printf("%d ",b[i][j]);
puts("");
}
return 0;
}
双指针算法
AcWing 799.最长连续不重复子序列
双指针算法
for (int i = 0, j = 0; i < n; i ++ )
{
while (j < i && check(i, j)) j ++ ;
// 具体问题的逻辑
O(n^2)-->O(n)
}
常见问题分类:
(1) 对于一个序列,用两个指针维护一段区间
(2) 对于两个序列,维护某种次序,比如归并排序中合并两个有序序列的操作
//Q:输出一个空格分割的字符串,每个一行
#include<iostream>
#include<string.h>
#include<cstdio>
using namespace std;
int main()
{
char str[1000];
gets(str);
int n = strlen(str);
for(int i = 0;i < n;i++)
{
int j = i;
while(j < n && str[j] != ' ') j++;
for(int k = i;k < j;k++) cout << str[k];
cout << endl;
i = j;
}
return 0;
}
//朴素 O(n^2)
for(int i = 0;i < n;i++)
for(int j = 0;j < n;j++)
if(check(j,i))
{
res = max(res,i- j + 1);
}
//双指针 O(n)
for(int i = 0,j = 0;i < n;i++)
{
while(j <= i && check(j,i)) j ++;//j往左走最远能到什么地方
res = max(res, i- j + 1);
}
#include<iostream>
using namespace std;
const int N = 100010;
int n;
int a[N],s[N];
int main()
{
cin >> n;
for(int i = 0;i < n;i++) cin >> a[i];
int res = 0;
for(int i = 0,j = 0;i < n;i++)
{
s[a[i]]++;
while(s[a[i]] > 1)
{
s[a[j]]--;
j++;
}
res = max(res,i - j + 1);
}
cout << res << endl;
return 0;
}
AcWing 800.数组元素的目标和
#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
const int N = 100010;
int n,m,x;
int a[N],b[N];
int main()
{
scanf("%d%d%d",&n,&m,&x);
for(int i = 0;i < n;i++) scanf("%d",&a[i]);
for(int i = 0;i < m;i++) scanf("%d",&b[i]);
for(int i = 0,j = m - 1;i < n;i++)
{
while(j >= 0 && a[i] + b[j] > x) j --;
if(a[i] + b[j] == x)
{
printf("%d %d\n",i,j);
break;
}
}
return 0;
}
AcWing 2186.判断子序列
#include<iostream>
#include<cstring>
using namespace std;
const int N = 100010;
int n, m;
int a[N], b[N];
int main()
{
scanf("%d%d",&n,&m);
for(int i = 0;i < n;i++) scanf("%d",&a[i]);
for(int i = 0;i < m;i++) scanf("%d",&b[i]);
int i = 0, j = 0;
while(i < n && j < m)
{
if(a[i] == b[j]) i++;
j ++ ;
}
if( i == n ) puts("Yes");
else puts("No");
return 0;
}
位运算
AcWing 801.二进制中1的个数
看n的二进制表示中第k位是几
1.先把第k位移到最后一位n >> k
2.看一下个位是几 x & 1
====>n >> k & 1(求第k位数字)
#include<iostream>
using namespace std;
int main()
{
int n = 10;
for(int k = 3;k>= 0; k--) cout << (n >> k & 1);
return 0;
}
//lowbit(x):返回的是x的最后一位1
x = 1010 ===>10;
x = 101000 ===> 1000;
x & -x = x & (~x + 1)
x = 101000100
~x = 010111011
~x + 1 = 010111100
x&(~x+1) = 000000100
#include<iostream>
using namespace std;
int lowbit(int x)
{
return x & ~x;
}
int main()
{
int n; cin >> n;
while(n -- )
{
int x; cin >> x;
int res = 0;
while(x) x -= lowbit(x),res ++;
cout << res << ' ';
}
return 0;
}
x = 1010
原码:0......01010
反码:1......10101
补码:1......10110
离散化
AcWing 802. 区间和
vector<int> alls; // 存储所有待离散化的值
sort(alls.begin(), alls.end()); // 将所有值排序
alls.erase(unique(alls.begin(), alls.end()), alls.end()); // 去掉重复元素
// 二分求出x对应的离散化的值
int find(int x) // 找到第一个大于等于x的位置
{
int l = 0, r = alls.size() - 1;
while (l < r)
{
int mid = l + r >> 1;
if (alls[mid] >= x) r = mid;
else l = mid + 1;
}
return r + 1; // 映射到1, 2, ...n
}
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
using namespace std;
typedef pair<int, int> PII;
const int N = 300010;
int n, m;
int a[N], s[N];
vector<int>alls;
vector<PII>add, query;
int find(int x)
{
int l = 0, r = alls.size() - 1;
while (l < r)
{
int mid = l + r >> 1;
if (alls[mid] >= x) r = mid;
else l = mid + 1;
}
return r + 1;//下标从1...n
}
//vector<int >::iterator unique(vector<int>& a)
//{
// int j = 0;
// for (int i = 0; i < a.size(); i++)
// if (!i || a[i] != a[i - 1])
// a[j++] = a[i];
// //a[0] ~ a[j - 1]所有a中不重复的数
// return a.begin() + j;
//}
int main()
{
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++)
{
int x, c;
scanf("%d%d", &x, &c);
add.push_back({ x,c });
alls.push_back(x);
}
for (int i = 0; i < m; i++)
{
int l, r;
scanf("%d%d", &l, &r);
query.push_back({ l, r });
alls.push_back(l);
alls.push_back(r);
}
//去重
sort(alls.begin(), alls.end());
alls.erase(unique(alls.begin(), alls.end()), alls.end());
//处理插入
for (auto item : add)
{
int x = find(item.first);
a[x] += item.second;
}
//预处理前缀和
int len = alls.size();
for (int i = 1; i <= len; i++) s[i] = s[i - 1] + a[i];
//处理询问
for (auto item : query)
{
int l = find(item.first), r = find(item.second);
printf("%d\n", s[r] - s[l - 1]);
}
return 0;
}
区间合并
AcWing 803. 区间合并
// 将所有存在交集的区间合并
void merge(vector<PII> &segs)
{
vector<PII> res;
sort(segs.begin(), segs.end());
int st = -2e9, ed = -2e9;
for (auto seg : segs)
if (ed < seg.first)
{
if (st != -2e9) res.push_back({st, ed});
st = seg.first, ed = seg.second;
}
else ed = max(ed, seg.second);
if (st != -2e9) res.push_back({st, ed});
segs = res;
}
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef pair<int, int> PII;
const int N = 100010;
int n;
vector<PII>segs;
void merge(vector<PII>& segs)
{
vector<PII> res;
sort(segs.begin(), segs.end());
int st = -2e9, ed = -2e9;
for (auto seg : segs)
if (ed < seg.first)
{
if (st != -2e9) res.push_back({ st,ed });
st = seg.first, ed = seg.second;
}
else ed = max(ed, seg.second);
if (st != -2e9) res.push_back({ st,ed });
segs = res;
}
int main()
{
cin >> n;
for (int i = 0; i < n; i++)
{
int l, r;
cin >> l >> r;
segs.push_back({ l,r });
}
merge(segs);
cout << segs.size() << endl;
return 0;
}