#include<iostream>
using namespace std;

#define N 1000

int cmp(const void *p,const void *q)
{
	int *p1 = (int *)p;
	int *q1 = (int *)q;
	return (*q1 - *p1);
}

int main ( )
{
	int length;
	int sets;
	char c;
    int measure[N];
	 
    char DNA[N][51];

	cin>>length>>sets;
    if(length <= 0||sets <= 0||length > 50||sets > 100)
	{
		exit (-1);
	}
	for(int i=0;i<sets;i++)
	{
		
		cin>>DNA[i];
		measure[i] = 0;
		for(int j=0;j<length-1;j++)
		{
			c = DNA[i][j];
			for(int k=j+1;k<length;k++)
			{
				if(DNA[i][k] < c)
				{
					measure[i]++;
				}
			}
			
		}
	}
	
	qsort(measure,sets,sizeof(int),cmp);
	for(int f=0;f<sets;f++)
	{
		cout<<measure[f]<<endl;
	}
    return 0;
}

• Re:仅供你参考，希望对你有帮助！ (49) ccnufu 2008-08-27 11:09:32
• Re:仅供你参考，希望对你有帮助！ (31) ccnufu 2008-08-27 12:37:29