backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-15 03:10:07 +08:00
Code Issues Projects Releases Wiki Activity

formatting source-code for 153fb7b8a5

Browse Source
This commit is contained in:
github-actions
2020-05-30 04:02:09 +00:00
parent 92fe9495ec
commit 8a2de9842b
175 changed files with 1671 additions and 3460 deletions
Download Patch File Download Diff File Expand all files Collapse all files

33
range_queries/mo.cpp
View File

@@ -3,41 +3,35 @@ using namespace std;
const int N = 1e6 + 5;
int a[N], bucket[N], cnt[N];
int bucket_size;
struct query
{
struct query {
int l, r, i;
} q[N];
int ans = 0;
void add(int index)
{
void add(int index) {
cnt[a[index]]++;
if (cnt[a[index]] == 1)
ans++;
}
void remove(int index)
{
void remove(int index) {
cnt[a[index]]--;
if (cnt[a[index]] == 0)
ans--;
}
bool mycmp(query x, query y)
{
bool mycmp(query x, query y) {
if (x.l / bucket_size != y.l / bucket_size)
return x.l / bucket_size < y.l / bucket_size;
return x.r < y.r;
}
int main()
{
int main() {
int n, t, i, j, k = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) scanf("%d", &a[i]);
bucket_size = ceil(sqrt(n));
scanf("%d", &t);
for (i = 0; i < t; i++)
{
for (i = 0; i < t; i++) {
scanf("%d %d", &q[i].l, &q[i].r);
q[i].l--;
q[i].r--;
@@ -45,26 +39,21 @@ int main()
}
sort(q, q + t, mycmp);
int left = 0, right = 0;
for (i = 0; i < t; i++)
{
for (i = 0; i < t; i++) {
int L = q[i].l, R = q[i].r;
while (left < L)
{
while (left < L) {
remove(left);
left++;
}
while (left > L)
{
while (left > L) {
add(left - 1);
left--;
}
while (right <= R)
{
while (right <= R) {
add(right);
right++;
}
while (right > R + 1)
{
while (right > R + 1) {
remove(right - 1);
right--;
}