c程序最大间隙问题金币列阵问题最多约数问题等

《c程序最大间隙问题金币列阵问题最多约数问题等》由会员上传分享，免费在线阅读，更多相关内容在工程资料-天天文库。

1、A、STr最大间隙问题#includeusingnamespacestd;constintMAX=200001;doublenum[MAX]；boolrun(){intn;if(scanf("%d",&n)=E0F)returnfalse;inti;doublemax=0.0,min=INT_MAX;for(i=0;imax)max=num[i];if(numEi]

2、double[n];double*high二newdouble[n];for(i=0;ihigh[tmp])high[tmp]=num[i];if(num[i]

3、){if(ent[i]>0){doubletmp=low[i]-t;if(tmp>res)res=tmp;t=high[i];}}cout〈〈res«endl;returntrue;}intmain(){while(run());return0;B、金币列阵问题^include^includeusingnamespacestd;constintsize=100;intk,n,m,ccount,best;intb0[size+l][size+1],bl[size+1][size+1],b[size+l][size+1];b

4、oolfound;voidprint(){for(inti=1;i<=n;i++){for(intj二1;j<=m;j++)cout«bl[i][j]«cout«endl;}}voidtransl(intx)//行翻转for(inti=1;i<=m;i++)bl[x][i]=bl[x][i]J;ccount++;}voidtrans2(intx,inty)//列交换{for(inti=1;i〈=n;i++)swap(bl[i][x],bl[i][y]);if(x!=y)ccount++;}boolsame(intx,inty){for(inti=1;i<=n

5、;i++)if(bO[i][x]!=bl[i][y])returnfalse;returntrue;}voidacpy(inta[size+l][size+1],intb[size+l][size+1])for(inti=1；i<=n;i++)for(intj=1；j<=m;j++)=b[i][j];/voidanswer()intx,y,j,p；cin»1for(int(i=1;i<=k;i++)cin»n>>m;//原状态bOfor(x=1;x<=n;x++)for(y=1;y<=m;y++)cin>>bO[x][y];〃目标状态blfor(x=1;x<

6、=n;x++)for(inty=1;ym;y++)cin»bl[x][y];acpy(b,bl);best=m+n+1;for(j=1;j<=m;j++)acpy(bl,b);ccount=0;trans2(l,j);//列变换intp;for(p=1;p<=n;p++)if(bO[p][1]!=bl[p]⑴)transl(p);//行变换for(p=1;p<=m;p++)//找列相等的(bl的q列和bO的p列相等){found=false;for(intq二p；q<=m;q++)if(same(p,q)){trans2(p,q);found=true;br

7、eak;}if(!found)break;}if(found&&ccountusingnamespacestd;#definemaxMaxconstlongMAXP=100000;longprim[MAXP];longmax,numb,PCOUNT;voidprimes();voidsearch(longfrom,

8、longtot,longnum,longlow,lo