BZOJ2724 蒲公英

法一：分块暴力维护

 unique去重的时候剩余个数为unique-num-1！！！！！！！！！！

因为这个检查了好久！！！！！！！！

#include <cstdio>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
const int N=4e4+5;
typedef double db;
int a[N],cnt[N][1005],num[N],l[N],maxn[45][45],pos[N],cntt[N][45][45];
vector<int>tr[N];
int main(){
    #ifndef ONLINE_JUDGE
    freopen("D:\\work\\data.in","r",stdin);
    #endif
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
        num[i]=a[i];
    }
    sort(num+1,num+n+1);
    int len=unique(num+1,num+n+1)-num-1;//这里不要忘了-1
    for(int i=1;i<=n;i++){
        a[i]=lower_bound(num+1,num+len+1,a[i])-num;
        tr[a[i]].push_back(i);
    }
    int t=pow((db)n,1.0/3.0),p=n/t;
    for(int i=1;i<=t;i++) l[i]=(i-1)*p+1;
    if(t*p<n){
        ++t;
        l[t]=(t-1)*p+1;//不能t*p+1，保存的是l，上面已经++t了，所以还要-1再乘
    }
    ++t;
    l[t]=n+1;
    for(int i=2;i<=t;i++)
    {
        for(int j=1;j<=len;j++) cnt[j][i]=cnt[j][i-1]; 
        for(int j=l[i-1];j<l[i];j++) {
            ++cnt[a[j]][i];
            pos[j]=i-1;//i-1,不是i；左边才代表第i块
        }
    }
    for(int i=1;i<=t;i++)
        for(int j=i+1;j<=t;j++){
            int tmpmax=0;
            for(int k=1;k<=len;k++){
                int tmp=cnt[k][j]-cnt[k][i];
                cntt[k][i][j]=tmp;
                if(tmp>tmpmax){
                    tmpmax=tmp;
                    maxn[i][j]=k;
                }
            }
        }
    int x=0,L,R;
    for(int i=1;i<=m;i++){
        scanf("%d%d",&L,&R);
        L=(L+x-1)%n+1;
        R=(R+x-1)%n+1;
        if(L>R) swap(L,R);
        x=len+1;
        int maxx=0,p=pos[L],q=pos[R];
        if(p==q){
            for(int j=L;j<=R;j++){
                int tmpcnt=upper_bound(tr[a[j]].begin(),tr[a[j]].end(),R)-lower_bound(tr[a[j]].begin(),tr[a[j]].end(),L);
                if(tmpcnt>maxx||(tmpcnt==maxx&&a[j]<x)){
                    maxx=tmpcnt;
                    x=a[j];
                }
            }
            x=num[x];
            printf("%d\n",x);
        }else{
            for(int j=L;j<l[p+1];j++){
                int tmpcnt=cntt[a[j]][p+1][q];
                tmpcnt+=upper_bound(tr[a[j]].begin(),tr[a[j]].end(),l[p+1]-1)-lower_bound(tr[a[j]].begin(),tr[a[j]].end(),L);
                tmpcnt+=upper_bound(tr[a[j]].begin(),tr[a[j]].end(),R)-lower_bound(tr[a[j]].begin(),tr[a[j]].end(),l[q]);
                if(tmpcnt>maxx||(tmpcnt==maxx&&a[j]<x)){
                    maxx=tmpcnt;
                    x=a[j];
                }
            }
            for(int j=l[q];j<=R;j++){
                int tmpcnt=cntt[a[j]][p+1][q];
                tmpcnt+=upper_bound(tr[a[j]].begin(),tr[a[j]].end(),l[p+1]-1)-lower_bound(tr[a[j]].begin(),tr[a[j]].end(),L);
                tmpcnt+=upper_bound(tr[a[j]].begin(),tr[a[j]].end(),R)-lower_bound(tr[a[j]].begin(),tr[a[j]].end(),l[q]);
                if(tmpcnt>maxx||(tmpcnt==maxx&&a[j]<x)){
                    maxx=tmpcnt;
                    x=a[j];
                }
            }
            if(cntt[maxn[p+1][q]][p+1][q]>maxx||(cntt[maxn[p+1][q]][p+1][q]==maxx&&maxn[p+1][q]<x)) x=maxn[p+1][q];
            x=num[x];
            printf("%d\n",x);
        }
    }
}

法二：

分块后二分计数

#include <cstdio>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
const int N=4e4+5;
typedef double db;
int a[N],cnt[N][1005],num[N],l[N],maxn[1005][1005],pos[N];
vector<int>tr[N];
int main(){
    #ifndef ONLINE_JUDGE
    freopen("D:\\work\\data.in","r",stdin);
    #endif
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
        num[i]=a[i];
    }
    sort(num+1,num+n+1);
    int len=unique(num+1,num+n+1)-num-1;//这里不要忘了-1
    for(int i=1;i<=n;i++){
        a[i]=lower_bound(num+1,num+len+1,a[i])-num;
        tr[a[i]].push_back(i);
    }
    int t=sqrt(n*log2(n)),p=n/t;
    for(int i=1;i<=t;i++) l[i]=(i-1)*p+1;
    if(t*p<n){
        ++t;
        l[t]=(t-1)*p+1;//不能t*p+1，保存的是l，上面已经++t了，所以还要-1再乘
    }
    ++t;
    l[t]=n+1;
    for(int i=2;i<=t;i++)
    {
        for(int j=1;j<=len;j++) cnt[j][i]=cnt[j][i-1]; 
        for(int j=l[i-1];j<l[i];j++) {
            ++cnt[a[j]][i];
            pos[j]=i-1;//i-1,不是i；左边才代表第i块
        }
    }
    for(int i=1;i<=t;i++)
        for(int j=i+1;j<=t;j++){
            maxn[i][j]=maxn[i][j-1];
            int tmpmax=cnt[maxn[i][j]][j]-cnt[maxn[i][j]][i];
            for(int k=l[j-1];k<l[j];k++){
                int tmp=cnt[a[k]][j]-cnt[a[k]][i];
                if(tmp>tmpmax||(tmp==tmpmax&&a[k]<maxn[i][j])){
                    tmpmax=tmp;
                    maxn[i][j]=a[k];
                }
            }
        }
    int x=0,L,R;
    for(int i=1;i<=m;i++){
        scanf("%d%d",&L,&R);
        L=(L+x-1)%n+1;
        R=(R+x-1)%n+1;
        if(L>R) swap(L,R);
        x=len+1;
        int maxx=0,p=pos[L],q=pos[R];
        if(p==q){
            for(int j=L;j<=R;j++){
                int tmpcnt=upper_bound(tr[a[j]].begin(),tr[a[j]].end(),R)-lower_bound(tr[a[j]].begin(),tr[a[j]].end(),L);
                if(tmpcnt>maxx||(tmpcnt==maxx&&a[j]<x)){
                    maxx=tmpcnt;
                    x=a[j];
                }
            }
            x=num[x];
            printf("%d\n",x);
        }else{
            for(int j=L;j<l[p+1];j++){
                int tmpcnt=upper_bound(tr[a[j]].begin(),tr[a[j]].end(),R)-lower_bound(tr[a[j]].begin(),tr[a[j]].end(),L);
                if(tmpcnt>maxx||(tmpcnt==maxx&&a[j]<x)){
                    maxx=tmpcnt;
                    x=a[j];
                }
            }
            for(int j=l[q];j<=R;j++){
                int tmpcnt=upper_bound(tr[a[j]].begin(),tr[a[j]].end(),R)-lower_bound(tr[a[j]].begin(),tr[a[j]].end(),L);
                if(tmpcnt>maxx||(tmpcnt==maxx&&a[j]<x)){
                    maxx=tmpcnt;
                    x=a[j];
                }
            }
            int tmpcnt=upper_bound(tr[maxn[p+1][q]].begin(),tr[maxn[p+1][q]].end(),R)-lower_bound(tr[maxn[p+1][q]].begin(),tr[maxn[p+1][q]].end(),L);
            if(tmpcnt>maxx||(tmpcnt==maxx&&maxn[p+1][q]<x)) x=maxn[p+1][q];
            x=num[x];
            printf("%d\n",x);
        }
    }
}