\u90fd\u8bf4\u53eb\u5206\u6bb5HASH\u3002\u3002
\u6211\u89c9\u5f97\u8fd8\u662f\u6709\u70b9\u5757\u72b6\u6570\u7ec4\u7684\u611f\u89c9\u3002\u3002
\u7528stl\u5199\u5e73\u8861\u6570\u5f88\u65b9\u4fbf\u4e0d\u8fc7\u8fd8\u662f\u5757\u72b6\u6570\u7ec4\u723d\u3002\u3002
\u53ef\u4ee5\u662f\u8d1f\u6570\u7684\u963f\u3002\u3002\u597d\u8d31\u3002\u3002\u3002
Code\u3002\u3002
#include<cstdio>
#include<iostream>
using namespace std;
const int maxn=1000001,maxv=maxn*2,maxsize=1000,maxL=maxv\/maxsize+10;
int C[maxv]={0};
int D[maxL]={0};
int n,Blocks;
void insert(int n)
{
C[n]++;
D[n\/maxsize]++;
}
void del(int n)
{
C[n]–;
D[n\/maxsize]–;
}
int getMin()
{
int i,j;
for(i=0;i<maxL;i++)
if(D[i]) break;
for(j=i*maxsize;;j++)
if(C[j]) break;
return j;
}
int getMax()
{
int i,j;
for(i=maxL-1;i>=0;i–)
if(D[i]) break;
for(j=(i+1)*maxsize-1;;j–)
if(C[j]) break;
return j;
}
int main()
{
cin>>n;int k,t;
long long ans=0;
while(n–)
{
scanf("%d",&k);
while(k–)
scanf("%d",&t),insert(t+maxn);
int Max=getMax(),Min=getMin();
ans+=Max-Min;
del(Max);del(Min);
}
cout<<ans<<endl;
} <\/p>\n","protected":false},"excerpt":{"rendered":"
\u90fd\u8bf4\u53eb\u5206\u6bb5HASH\u3002\u3002\u6211\u89c9\u5f97\u8fd8\u662f\u6709\u70b9\u5757\u72b6\u6570\u7ec4\u7684\u611f\u89c9\u3002\u3002\u7528stl\u5199\u5e73\u8861\u6570\u5f88\u65b9\u4fbf\u4e0d\u8fc7\u8fd8\u662f\u5757\u72b6\u6570\u7ec4\u723d\u3002\u3002\u53ef\u4ee5\u662f\u8d1f\u6570\u7684\u963f\u3002\u3002\u597d\u8d31\u3002\u3002\u3002Code\u3002\u3002#include<cstdio>#include<iostream>using namespace std;const int maxn=1000001,maxv=maxn*2,maxsize=1000,maxL=maxv\/maxsize+10;int C[maxv]={0};int D[maxL]={0};int n,Blocks;void insert(int n){ C[n]++; D[n\/maxsize]++;}void del(int n){ C[n]–; D[n\/maxsize]–;}int getMin(){ int i,j; for(i=0;i<maxL;i++) if(D[i]) break; for(j=i*maxsize;;j++) if(C[j]) break; return j;}int getMax(){ int i,j; for(i=maxL-1;i>=0;i–) if(D[i]) break; for(j=(i+1)*maxsize-1;;j–) if(C[j]) break; return j;}int main(){ cin>>n;int k,t; long long ans=0; while(n–) { scanf("%d",&k); while(k–) scanf("%d",&t),insert(t+maxn); int Max=getMax(),Min=getMin(); ans+=Max-Min; del(Max);del(Min); } cout<<ans<<endl;}<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[10],"tags":[],"jetpack_featured_media_url":"","_links":{"self":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts\/26"}],"collection":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=26"}],"version-history":[{"count":0,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts\/26\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=26"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=26"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=26"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}