我的代码：
#include <iostream>
using namespace std;

char DNAs[100][50];
int nLength, nDNANumber;
typedef struct _Measure
{
	int nValue;
	int nIndex;
} Measure;

Measure measure[50];

int main()
{
	int i, j, k;
	
	//input
	cin>>nLength>>nDNANumber;
	for(i = 0; i < nDNANumber; i++)
	{
		cin>>DNAs[i];
	}

	//calculate the measurement number
	for(i = 0; i < nDNANumber; i++)
	{
		measure[i].nIndex = i;
		for(j = 0; j < nLength - 1; j++)
		{
			for(k = j + 1; k < nLength; k++)
			{
				if(DNAs[i][j] > DNAs[i][k])
				{
					measure[i].nValue++;
				}
			}
		}
	}

	//sort the measurement value, we must use a steady sort method
	//now, I use Insertion Sort
	Measure temp;
	int min;
	for(i = 0; i < nDNANumber - 1; i++)
	{
		min = i;
		for(j = i + 1; j < nDNANumber; j++)
		{
			if(measure[min].nValue > measure[j].nValue)
			{
				min = j;
			}
		}

		if(min != i)
		{
			temp = measure[min];
			for(j = min; j > i; j--)
			{
				measure[j] = measure[j - 1];
			}
			measure[i] = temp;
		}
	}

	//output the result
	for(i = 0; i < nDNANumber; i++)
	{
		cout<<DNAs[measure[i].nIndex]<<endl;
	}

	return 0;
}

• 我好蠢 。。。 (0) speedfirst 2005-08-14 10:51:17