双指针第三题:
#include<iostream>
#include<cstring>
using namespace std;
const int N = 100010;
int n,m;
int a[N],b[N];
int main()
{
cin>>n>>m;
for(int i = 0;i < n ;i ++ )
cin >> a[i];
for(int i = 0;i < m; i ++ )
cin >> b[i];
int i = 0,j = 0;
while(i < n && j < m)
{
if(a[i] == b[j]) i ++ ;
j ++ ;
}
if(i == n)
cout<<"Yes";
else
cout<<"No";
return 0;
}
没有想到吧,根本不需要什么高深的算法,非常的简单。
然后就是二进制的lowbit
#include<iostream>
using namespace std;
int lowbit(int x)
{
return x & -x;
}
int main()
{
int n,m;
int res;
cin>>n;
while(n--)
{
cin>>m;
res = 0;
while(m)
{
m = m - lowbit(m);
res = res + 1;
}
cout<<res<<" ";
}
return 0;
}
模板:
求n的第k位数字: n >> k & 1
返回n的最后一位1:lowbit(n) = n & -n
然后下午花了很长的时间学了一下离散化
总体来说就是这个题目的数据范围太大了,但是数量很少,开不了那么大的数组,但是有些空间又不需要,所以就用离散化把空间“压缩”了。
代码:
#include<iostream>
#include<vector>
#include<algorithm>
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;
}
int main()
{
cin >> n >> m;
for (int i = 0; i < n; i ++ )
{
int x, c;
cin >> x >> c;
add.push_back({x, c});
alls.push_back(x);
}
for(int i = 0;i < m; i ++ )
{
int l, r;
cin >> 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;
}
// 预处理前缀和
for(int i = 1;i <= alls.size(); i ++ )
s[i] = s[i - 1] + a[i];
//处理询问
for (auto item : query)
{
int l = find(item.first),r = find(item.second);
cout << s[r] - s[l - 1] << endl;
}
return 0;
}
离散化的模板:
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<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;
}
终于把基础算法看完了,下面开始看数据结构
代码:
#include <iostream>
using namespace std;
const int N = 1000010;
int a[N], q[N];
int main()
{
int n, k;
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i ++ ) scanf("%d", &a[i]);
int hh = 0, tt = -1;
for (int i = 0; i < n; i ++ )
{
if (hh <= tt && i - k + 1 > q[hh]) hh ++ ;
while (hh <= tt && a[q[tt]] >= a[i]) tt -- ;
q[ ++ tt] = i;
if (i >= k - 1) printf("%d ", a[q[hh]]);
}
puts("");
hh = 0, tt = -1;
for (int i = 0; i < n; i ++ )
{
if (hh <= tt && i - k + 1 > q[hh]) hh ++ ;
while (hh <= tt && a[q[tt]] <= a[i]) tt -- ;
q[ ++ tt] = i;
if (i >= k - 1) printf("%d ", a[q[hh]]);
}
puts("");
return 0;
}