我在ZJU过了的
FT
> #include <stdio.h>
> #include <stdlib.h>
> char map[100][51];
> int sign[100];
> int value[100];
> int n, m;
> int cmp(const void *a, const void *b)
> {
> 	return value[*(int *)a] > value[*(int *)b];
> }
> int main()
> {
> 	int i, j, k;
> 		scanf("%d %d", &m, &n);
> 		for(i = 0 ; i < n; i++)
> 		{
> 			sign[i] = i;
> 			scanf("%s", map[i]);
> 			value[i] = 0;
> 			for(j = 0 ; j < m - 1; j++)
> 			{
> 				for(k = j + 1; k < m; k++)
> 				{
> 					if(map[i][j] > map[i][k])
> 						value[i]++;
> 				}
> 			}			
> 		}
> 		qsort(sign, n, sizeof(sign[0]), cmp);
> 		for(i = 0 ; i < n ; i++)
> 		{
> 			printf("%s\n", map[sign[i]]);
> 		}
> 
> 	return 1;
> }

• Re:如此的题目怎么会WA?? (35) a 2003-08-29 15:59:54
  • Re:如此的题目怎么会WA?? (14) liulike 2003-08-30 16:04:06
  • 过了sample了不起啊？哈哈 (19) yangguo981 2005-09-12 12:31:51