Description
Data Constraint
Solution
对于这种区间查询的题,我们直接上莫队,用堆处理一下就可以用O(N N−−√logN )的时间卡过去。
代码
#include<iostream>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<algorithm>
#define ll long long
using namespace std;
const int maxn=100005;
struct code{
int a,b,c;
}b[maxn];
int c[maxn],n,m,i,t,j,k,p,num,l[maxn],r[maxn],x,y,z;
int d[maxn],f[maxn];
ll ans[maxn],a[maxn],bz[maxn];
bool cmp(code x,code y){
return x.a<y.a || x.a==y.a && x.b<y.b;
}
ll pan(int x){
return a[x]*bz[c[x]];
}
void up(int x){
while (pan(d[x])>pan(d[x/2]) && x!=1){
swap(d[x],d[x/2]);
f[c[d[x]]]=x;x/=2;f[c[d[x]]]=x;
}
}
int main(){
// freopen("data.in","r",stdin);freopen("data.out","w",stdout);
scanf("%d%d",&n,&m);p=sqrt(n);
for (i=1;i<=n;i++)
scanf("%d",&a[i]),b[i].a=a[i],b[i].c=i;
sort(b+1,b+n+1,cmp);
for (i=1;i<=n;i++){
if (b[i].a!=b[i-1].a) num++;
c[b[i].c]=num;
}
for (i=1;i<=m;i++)
scanf("%d%d",&l[i],&r[i]),b[i].a=l[i]/p,b[i].b=r[i]/p,b[i].c=i;
sort(b+1,b+m+1,cmp);x=1;y=1;d[1]=1;bz[c[1]]++;num=1;f[c[1]]=1;
for (z=1;z<=m;z++){
j=b[z].c;
for (i=y+1;i<=r[j];i++){
bz[c[i]]++;
if (!f[c[i]]) f[c[i]]=++num,d[num]=i;
up(f[c[i]]);
}
for(i=l[j];i<x;i++){
bz[c[i]]++;
if (!f[c[i]]) f[c[i]]=++num,d[num]=i;
up(f[c[i]]);
}
for (i=r[j]+1;i<=y;i++){
bz[c[i]]--;
if (bz[c[i]]) down(f[c[i]]);
else{
d[f[c[i]]]=d[num];
f[c[d[num]]]=f[c[i]];
f[c[i]]=0;
num--;
}
}
for (i=x;i<l[j];i++){
bz[c[i]]--;
if (bz[c[i]]) down(f[c[i]]);
else{
d[f[c[i]]]=d[num];
f[c[d[num]]]=f[c[i]];
f[c[i]]=0;
num--;
}
}
x=l[j];y=r[j];
ans[j]=pan(d[1]);
}
for (i=1;i<=m;i++)
printf("%lld\n",ans[i]);
}
.