1488 Problem J-qwb又偷懒了

思路：

离散化点查点插线段树

#include <iostream>#include <algorithm>#include <stdio.h>#include <cstring>#include <map>using namespace std;const int maxn=300005;int has[1000005];int step[maxn];int id[maxn];struct node{    int left,right;    long long sum,num;}tree[maxn*4];struct ct2{    int left, right ;}oper2[maxn*2];struct ct1{    int num,id,fir,kind;}oper1[maxn*2];int n; void push_up(int i){    tree[i].sum=tree[i<<1].sum+tree[i<<1|1].sum;    tree[i].num=tree[i<<1].num+tree[i<<1|1].num;    return ;}void build(int i,int left,int right){    tree[i].left=left,tree[i].right=right;    tree[i].num=0;    tree[i].sum=0;    if(left==right)    {        return ;    }    int mid=(tree[i].left+tree[i].right)>>1;    build(i<<1,left,mid);    build(i<<1|1,mid+1,right);    return ;}void add(int i,int aim){    if(tree[i].left==tree[i].right&&tree[i].left==aim)    {        tree[i].sum+=has[tree[i].left];        tree[i].num++;        return ;    }    int mid=(tree[i].left+tree[i].right)>>1;    if(aim<=mid)        add(i<<1,aim);    else        add(i<<1|1,aim);    push_up(i);    return ;}long long  ans,peo;void query(int i,int left,int right){    if(tree[i].left==left&&tree[i].right==right)    {        ans+=tree[i].sum;        peo+=tree[i].num;        return ;    }    int mid=(tree[i].left+tree[i].right)>>1;    if(right<=mid)        query(i<<1,left,right);    else if(left>mid)    query(i<<1|1,left,right);    else    {        query(i<<1,left,mid);        query(i<<1|1,mid+1,right);    }    return ;}bool cmpnum(ct1 x,ct1 y){    return x.num<y.num;}bool cmpfir(ct1 x,ct1 y){    return x.fir<y.fir;}int main(){    int xc=1;    while(scanf("%d",&n)!=EOF)    {        memset(has,0,sizeof(has));        map<int,int>mp;        if(xc!=1)            printf("\n");        xc++;        int n1=0,n2=0;        for(int i=1;i<=n;i++)        {            int op;            scanf("%d",&op);            if(op==0)            {                step[i]=1;                scanf("%d",&oper1[++n1].num);                oper1[n1].fir=i;                oper1[n1].kind=1;            }            else            {                step[i]=2;                scanf("%d",&oper2[++n2].left);                scanf("%d",&oper2[n2].right);                oper1[++n1].kind=2;                oper1[n1].fir=n*2+1;                oper1[n1].num=oper2[n2].left;                 oper1[++n1].kind=2;                oper1[n1].fir=n*2+1;                oper1[n1].num=oper2[n2].right;            }        }        int all=0,numm2=0;        sort(oper1+1,oper1+1+n1,cmpnum);        oper1[0].num=-1;        for(int i=1;i<=n1;i++)        {            if(oper1[i].num!=oper1[i-1].num)            {                oper1[i].id=++all;                mp[oper1[i].num]=all;                has[all]=oper1[i].num;            }            else            {                oper1[i].id=all;            }        }        sort(oper1+1,oper1+1+n1,cmpfir);        build(1,1,all);        int nm1=0,nm2=0;        for(int i=1;i<=n;i++)        {            if(step[i]==1)            {                ++nm1;                add(1,oper1[nm1].id);            }            else            {                ans=0,peo=0;                ++nm2;                query(1,mp[oper2[nm2].left],mp[oper2[nm2].right]);                if(peo==0)                {                    printf("zhizhiwuwu\n");                    continue;                }                long long  res=ans/(peo);                printf("%lld\n",res);            }        }    }} /* 30 10 31 0 3 */ /**************************************************************    Problem: 1488    User: ZJC2017Final379    Language: C++    Result: Accepted    Time:904 ms    Memory:55584 kb****************************************************************/