莫队
thusloop
这个作者很懒,什么都没留下…
展开
-
历史研究(回滚莫队)(add)
历史研究题意:给你一个长度为n的数组 和 q个询问 ,每次询问一个区间 l,r 内重要度最大的数字,要求 输出其重要度。一个数字 x重要度的定义为 x乘上x 在区间内出现的次数。//#pragma GCC optimize(2)//#pragma GCC optimize(3,"Ofast","inline")#include<bits/stdc++.h>#define int long long#define fi first#define se second#define原创 2021-11-03 18:06:07 · 99 阅读 · 0 评论 -
Count on a tree II(树上莫队)
Count on a tree II题意:树上区间询问 x到y的不同颜色数欧拉序上查询 ,不在同一子树上要加上lca的贡献 (ed->st)在同一子树上(st->st)//#pragma GCC optimize(2)//#pragma GCC optimize(3,"Ofast","inline")#include<bits/stdc++.h>#define int long long#define fi first#define se second#defi原创 2021-11-02 20:03:19 · 196 阅读 · 0 评论 -
Machine Learning(带修莫队)
Machine Learning区间出现次数的mex用桶暴力求mex#pragma GCC optimize(2)#pragma GCC optimize(3,"Ofast","inline")#include<bits/stdc++.h>#define int long long#define fi first#define se second#define pb push_back#define pii pair<int,int>#define IOS io原创 2021-11-02 16:08:12 · 93 阅读 · 0 评论 -
数颜色 / 维护队列(带修莫队板子)
数颜色 //#pragma GCC optimize(2)//#pragma GCC optimize(3,"Ofast","inline")#include<bits/stdc++.h>#define int long long#define fi first#define se second#define pb push_back#define pii pair<int,int>#define IOS ios::sync_with_stdio(false);ci原创 2021-10-29 16:42:42 · 98 阅读 · 0 评论 -
Powerful array(莫队奇偶优化)
Powerful array//#pragma GCC optimize(2)//#pragma GCC optimize(3,"Ofast","inline")#include<bits/stdc++.h>#define int long long#define fi first#define se second#define pb push_back#define pii pair<int,int>#define IOS ios::sync_with_stdio原创 2021-10-21 17:04:57 · 196 阅读 · 0 评论 -
Different Integers(莫队板子)
Different Integers题意:求区间 1-i 和j-n的不同数的数量。#pragma GCC optimize(2)#pragma GCC optimize(3,"Ofast","inline")#include<bits/stdc++.h>//#define int long long#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);using namespace std;const int原创 2021-10-03 14:28:59 · 81 阅读 · 0 评论 -
Cut and Stick(莫队)
传送门莫队维护出现最多数的个数#include<bits/stdc++.h>#define int long long#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);using namespace std;const int inf=2e18+100;const int maxn=3e5+100;int a[maxn],pos[maxn],mx,c[maxn],cnt[maxn];int ans[ma原创 2021-09-12 15:20:20 · 189 阅读 · 0 评论