算法分析代码.docVIP

符号三角形 #include iostream.h? #include math.h? class Triangle{? ? friend int Compute(int);? private:? void Backtrack(int t);? int n, half, //n*(n+1)/4? count, **p; long sum; };? void Triangle::Backtrack(int t)? {? if((counthalf) ||(t*(t-1)/2-counthalf)) return;? if(tn) sum++;? else? for(int i=0;i 2;i++){? p[1][t]=i;? count+=i;? for(int j=2;j t;j++){? p[j][t-j+1]=p[j-1][t-j+1]^p[j-1][t-j+2];? count+=p[j][t-j+1];? }? Backtrack(t+1);? for(j=2;j t;j++)? count-=p[j][t-j+1];? count-=i;? }? }? int Compute(int n)? {? Triangle X;? X.n=n;? X.count=0;? X.sum=0;? X.half=n*(n+1)/2;? if(X.half%2==1) return 0;? X.half=X.half/2;? int **p=new int *[n+1];? for(int i=0;i n;i++) p[i]=new int[n+1];? for(i=0;i n;i++)? for(int j=0;j n;j++) p[i][j]=0;? X.p=p;? X.Backtrack(1);? return X.sum;? }? void main()? {? int tmp;? tmp=Compute(12);? cout tmp endl;? } 会场安排问题 #includeiostream.h#includefstream.hint stand(int n,int start[],int end[],bool vale[]);void sort(int n,int start[],int end[]); void main(){?int n,out;?int start[100],end[100];?bool vale[100];?fstream myfile1,myfile2;??? myfile1.open(text1.txt,ios::in);??? myfile1n;?coutnendl;?for(int i=0;in;i++)?{?myfile1start[i]end[i];? }?myfile1.close(); ?sort( n, start, end);//调用函数非递减排序 for( i=0;in;i++)vale[i]=0; ?out=stand(n,start,end,vale);//调用函数计算最小会场数???myfile2.open(output.txt,ios::out);?myfile2out;?myfile2.close(); ?} ? int stand(int n,int start[],int end[],bool vale[]){?int j=0,num=0;for(int k=0;kn;k++)if(vale[k]==0){ for ( int i=1;in;i++(vale[i==0])(vale[j]==0)) if(start[i]=end[j]){ vale[i]=1;vale[j]=1;j=i;}num++;} return? num;}//计算最小会场函数? void sort(int n,int start[],int end[]){?int strang1,strang2;for(int i=0;in-1;i++)for(int j=i+1;jn;j++){?if(end[i]end[j])?{??strang1=end[i];??? end[i]=end[j];??? end[j]=strang1;??? strang2=start[i];??? start[i]=start[j];??? start[j]=strang2;?}}}//非递减排序 字典序问题 #include iostream #include fstream #incl