backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-23 18:12:47 +08:00
Code Issues Projects Releases Wiki Activity

style: format code

Browse Source
This commit is contained in:
yanglbme
2019-08-21 10:10:08 +08:00
parent abc0d365de
commit 69ddc9fc52
101 changed files with 3154 additions and 2984 deletions
Download Patch File Download Diff File Expand all files Collapse all files

70
Range queries/MO.cpp
View File

@@ -1,75 +1,77 @@
#include "bits/stdc++.h"
using namespace std;
const int N = 1e6+5;
int a[N],bucket[N],cnt[N];
const int N = 1e6 + 5;
int a[N], bucket[N], cnt[N];
int bucket_size;
struct query{
int l,r,i;
}q[N];
int ans=0;
struct query
{
int l, r, i;
} q[N];
int ans = 0;
void add(int index)
{
cnt[a[index]]++;
if(cnt[a[index]] == 1)
if (cnt[a[index]] == 1)
ans++;
}
void remove(int index)
{
cnt[a[index]]--;
if(cnt[a[index]] == 0)
if (cnt[a[index]] == 0)
ans--;
}
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;
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 n,t,i,j,k=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
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++)
scanf("%d", &t);
for (i = 0; i < t; i++)
{
scanf("%d %d",&q[i].l,&q[i].r);
q[i].l--; q[i].r--;
scanf("%d %d", &q[i].l, &q[i].r);
q[i].l--;
q[i].r--;
q[i].i = i;
}
sort(q,q+t,mycmp);
int left=0,right=0;
for(i=0;i<t;i++)
sort(q, q + t, mycmp);
int left = 0, right = 0;
for (i = 0; i < t; i++)
{
int L=q[i].l, R=q[i].r;
while(left < L)
int L = q[i].l, R = q[i].r;
while (left < L)
{
remove(left);
left++;
}
while(left>L)
while (left > L)
{
add(left-1);
add(left - 1);
left--;
}
while(right<=R)
while (right <= R)
{
add(right);
right++;
}
while(right>R+1)
while (right > R + 1)
{
remove(right-1);
remove(right - 1);
right--;
}
bucket[q[i].i] = ans;
bucket[q[i].i] = ans;
}
for(i=0;i<t;i++)
printf("%d\n",bucket[i]);
for (i = 0; i < t; i++)
printf("%d\n", bucket[i]);
return 0;
}