PKU 1007 DNA Sorting

Run ID	User	Problem	Result	Memory	Time	Language	Code Length	Submit Time
6695759	kingpro	1007	Accepted	244K	0MS	C++	718B	2010-04-06 19:45:56

 

 

 1 #include <iostream>
 2 using namespace std;
 3 
 4 struct node
 5 {
 6     int sort;
 7     char * string;
 8 };
 9 int cmp(const void * a, const void * b){    return ((node *)a)->sort-((node *)b)->sort;    }
10 int main()
11 {
12     int length=0, count=0, i=0, j=0, k=0;
13     cin>>length>>count;
14     node * strings=new node[count];
15     for(i=0; i<count && (strings[i].string=new char[length+1], cin>>strings[i].string, true); i++);
16     for(i=0; i<count; i++)
17         for(strings[i].sort=0, j=0; j<length-1; j++)
18             for(k=j+1; k<length && (strings[i].string[j]>strings[i].string[k] && strings[i].sort++, true); k++);
19     for(qsort(strings, count, sizeof(strings[0]), cmp), i=0; i<count && (cout<<strings[i].string<<endl, true); i++);
20     delete [] strings;
21     return 0;
22 }

 

 

这个  貌似离散课上讲过这个逆序的概念...