链接: HDU-6959-zoto
题意:
给出一个数组 a[i] , 表示平面内有 n 个点,每个点的坐标为(i, a[ i ]),再给出 m 次查询,每次查询给出一个(x0 , y0) , (x1 , y1)的矩形区域 , 问矩形区域内有多少个不同的 y 坐标。
题意简化一下: 求区间 [x0 , x1] 内大于等于 y0,小于等于 y1的不同的数有多少个。
思路:
对于不同的区间 [x0 , x1]可以用莫队来移动,先确定一个区间,每次移动我们需要修改对应点的个数, 如果这个数的个数从无到有 ,或者从有到无 需要修改答案的权值 如果用数状数组修改的话会多一个 log 最坏的复杂度会有 O(n sqrt(n) log(n))。而用分块的话可以 o(1) 修改,最后的复杂度接近 O(n sqrt(n) )
代码:
分块:
#include <iostream>
#include <cstdio>
#include <queue>
#include <math.h>
#include <map>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 7;
int n, m, k, apart, curl = 1, curr;
int a[maxn], cnt[maxn];
int sum[maxn] , val[maxn],l[maxn],r[maxn] , num;
int block,belong[maxn];
int T , ans[maxn];
struct node {
int l, r, num;
int val_l,val_r;
/*bool operator<(const node &x) const { //奇偶优化
if (l / apart != x.l / apart) return l < x.l;
return (l / apart) & 1 ? r < x.r : r > x.r;
}*/
}G[maxn];
bool cmp(node x, node y){
return (x.l / apart == y.l / apart ) ? x.r < y.r : x.l < y.l;
}
void add (int x) {
cnt[a[x]] ++;
if(cnt[a[x]] == 1){
val[a[x]] ++;
sum[belong[a[x]]] ++;
}
}
void del (int x) {
cnt[a[x]] --;
if(cnt[a[x]] == 0){
val[a[x]] --;
sum[belong[a[x]]] --;
}
}
//分块
void build(){
block = sqrt(n);
num = n / block; if(n % block) num ++;
for(int i = 1;i <= num; i ++){
l[i] = (i - 1) * block + 1;
r[i] = min(n , i * block); //每个分块的左右端点
}
for(int i = 1; i <= n; i ++){
belong[i] = (i - 1) / block + 1; //求每个点所在分块
sum[belong[i]] += val[i];
}
}
int ask(int L , int R){
int ans = 0;
int s = belong[L], e = belong[R];
if(s == e){
for(int i = L; i <= R; i++){
ans += val[i];
}
return ans;
}
for(int i = L; i <= r[s]; i++){
ans += val[i];
}
for(int i = s + 1; i < e; i++){
ans += sum[i];
}
for(int i = l[e];i <= R;i ++){
ans += val[i];
}
return ans;
}
int main() {
scanf("%d",&T);
while(T--){
scanf("%d%d",&n,&m);
memset(sum , 0 , sizeof(sum));
memset(val , 0 , sizeof(val));
memset(cnt , 0 , sizeof(cnt));
curl = 0, curr = 0;
for(int i = 1; i <= n; i ++){
scanf("%d",&a[i]);
a[i]++;
}
apart = sqrt ( n );
for (int i = 1;i <= m;i ++ ) {
scanf ("%d%d%d%d",&G[i].l,&G[i].val_l,&G[i].r,&G[i].val_r);
G[i].val_l ++;
G[i].val_r ++;
G[i].num = i;
}
build();
sort ( G + 1, G + m + 1 , cmp);
for (int i = 1;i <= m;i ++ ){
int l = G[i].l, r = G[i].r;
while (curl < l){
del (curl ++);
}
while (curl > l){
add ( -- curl );
}
while (curr > r){
del (curr --);
}
while (curr < r){
add (++ curr);
}
ans[G[i].num] = ask(G[i].val_l , G[i].val_r);
}
for (int i = 1; i <= m; i++){
printf ("%d\n",ans[i]);
}
}
return 0;
}
树状数组:(可能被卡,接近极限跑过去的)
#include <iostream>
#include <cstdio>
#include <queue>
#include <math.h>
#include <map>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 7;
int n, m,ans[maxn],T, apart, curl , curr;
int a[maxn], cnt[maxn];
int val[maxn];
struct node {
int l, r, num;
int val_l,val_r;
}G[maxn];
bool cmp(node x, node y){
return (x.l / apart == y.l / apart ) ? x.r < y.r : x.l < y.l;
}
int lowbitt(int x){
return x & ( - x);
}
void update1(int x,int num){
while(x <= n){
val[x] += num;
x += lowbitt(x);
}
}
int query1(int x){
int sum = 0;
while(x > 0){
sum += val[x];
x -= lowbitt(x);
}
return sum;
}
void add (int x) {
cnt[a[x]] ++;
if(cnt[a[x]] == 1){
update1(a[x],1);
}
}
void del (int x) {
cnt[a[x]] --;
if(cnt[a[x]] == 0){
update1(a[x],-1);
}
}
int main() {
scanf("%d",&T);
while(T--){
scanf("%d%d",&n,&m);
memset(val , 0 , sizeof(val));
memset(cnt , 0 , sizeof(cnt));
curl = 0, curr = 0;
for(int i = 1; i <= n; i ++){
scanf("%d",&a[i]);
a[i]++;
}
apart = sqrt ( n );
for (int i = 1;i <= m;i ++ ) {
scanf ("%d%d%d%d",&G[i].l,&G[i].val_l,&G[i].r,&G[i].val_r);
G[i].val_l ++;
G[i].val_r ++;
G[i].num = i;
}
sort ( G + 1, G + m + 1, cmp );
for (int i = 1;i <= m;i ++ ){
int l = G[i].l, r = G[i].r;
while (curl < l){
del(curl ++);
}
while (curl > l){
add(-- curl);
}
while (curr > r){
del(curr --);
}
while (curr < r) {
add (++ curr);
}
ans[G[i].num] = query1(G[i].val_r) - query1(G[i].val_l - 1);
}
for (int i = 1; i <= m; i++){
printf ("%d\n",ans[i]);
}
}
return 0;
}