> #include<iostream.h>
> #include<string.h>
> #include<iomanip.h>
> #include<stdlib.h>
> char tree[1000000][30];
> int count[10000];
> int compare(const void *a,const void *b){
> 	return(strcmp((char*)a,(char*)b));
> }
> int cmp(char *a,char *b){
> 	for(int i=0;*(a+i)!='\0'||*(b+i)!='\0';i++)
> 		if(*(a+i)!=*(b+i))return 0;
> 	return 1;
> }
> void main()
> {
> 	int i=0,j=0,k=0;
> 	while(cin.getline(tree[i],30))
> 		i++;
> 	qsort(tree,i,sizeof(tree[0]),compare);
> 	int flags=0;
> 	double num=1;
> 	double jump=0.5;
> 	for(j=0;j<i;){
> 		for(k=0;;k++){
> 			jump*=2;
> 			if(cmp(tree[j],tree[j+int(jump)])==1)
> 				continue;
> 			else break;
> 		}
> 		if(jump==1){
> 			cout<<tree[j]<<" ";
> 			cout<<setiosflags(ios::fixed);
> 			cout<<setprecision(4)<<num*100/i<<endl;
> 			j++;
> 			jump=0.5;
> 			num=1;
> 			continue;
> 		}
> 		num+=int(jump/2);
> 		j+=int(jump/2);
> 		jump=0.5;
> 	}
> }

• Re:呜呜呜，优化了以后还是超时，哪位大虾指点下？ (17) 00403022 2005-04-30 00:06:43
  • Re:呜呜呜，优化了以后还是超时，哪位大虾指点下？ (77) frkstyc 2005-04-30 00:08:44