zoj 1188 - DNA Sorting

题目：给你一些DNA串，按串的逆序数排序。

分析：逆序数，排序。先求逆序数，然后排序即可。

说明：（2011-09-22 03:17）

#include <stdio.h>
#include <stdlib.h>

typedef struct node1
{
    char S[ 51 ];
    int  V;
}Nnode;
Nnode Node[ 101 ];

char Data[ 51 ];
char Save[ 51 ];

int MergeSort( int a, int b )
{
    if ( a < b ) {
        int L = MergeSort( a, (a+b)/2 );
        int R = MergeSort( (a+b)/2+1, b );
        int Count = L+R,move = a;
        int ps = a,pe = (a+b)/2;
        int qs = (a+b)/2+1,qe = b;
        while ( ps <= pe || qs <= qe ) 
            if ( qs <= qe && ( ps == pe+1 || Data[ ps ] > Data[ qs ] ) ) {
                Save[ move ++ ] = Data[ qs ++ ];
                Count += pe-ps+1;//计算A B 中的逆序数 
            }else 
                Save[ move ++ ] = Data[ ps ++ ];
        for ( int i = a ; i <= b ; ++ i )
            Data[ i ] = Save[ i ];
        return Count;
    }else return 0;
} 

int cmp( const void* a, const void* b )
{
    Nnode* p = (Nnode *)a;
    Nnode* q = (Nnode *)b;
    return p->V - q->V; 
}

int main()
{
    int n,m,N;
    scanf("%d",&N);
    for ( int k = 1 ; k <= N ; ++ k ) {
        scanf("%d%d",&n,&m);
        for ( int i = 0 ; i < m ; ++ i ) 
            scanf("%s",&(Node[ i ].S));
        for ( int i = 0 ; i < m ; ++ i ) {
            for ( int j = 0 ; j < n ; ++ j )
                Data[ j ] = Node[ i ].S[ j ];
            Node[ i ].V = MergeSort( 0, n-1 );
        }
        qsort( Node, m , sizeof( Node[ 0 ] ), cmp );
        for ( int i = 0 ; i < m ; ++ i )
            printf("%s\n",Node[ i ].S);
        if ( k != N ) printf("\n");
    } 
    return 0;
}