HDU1225 字符串

水题~~

字符串的处理+排序

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
const int maxn = 5005;
struct node{
    char name[ 105 ];
    int win,lost,diff,score;
}team[ maxn ];
int cnt;
void init( int n ){
    for( int i=0;i<=n;i++ ){
        team[ i ].win=team[ i ].lost=team[ i ].diff=team[ i ].score=0;
        //memset( team[i].name,'\0',sizeof( team[i].name ));
    }
    cnt=0;
}
int find( char tt[] ){
    if( cnt==0 ){
        strcpy( team[0].name,tt );
        cnt++;
        return 0;
    }
    int i;
    for( i=0;i<cnt;i++ ){
        if( strcmp( tt,team[i].name )==0 ){
            return i;
        }
    }
    if( i==cnt ){
        strcpy( team[cnt].name,tt );
        cnt++;
        return cnt-1;
    }
}
bool cmp( node a,node b ){
    if( a.score!=b.score )
        return a.score>b.score;
    else if( a.diff!=b.diff )
        return a.diff>b.diff;
    else if( a.win!=b.win )
        return a.win>b.win;
    else if( strcmp( a.name,b.name )>0 )
        return false;
    else return true;
}
int main(){
    int n;
    while( scanf("%d",&n)!=EOF ){
        init( n );
        char n1[ 105 ],n2[ 105 ];
        int num1,num2;
        for( int i=0;i<(n*(n-1));i++ ){
            scanf("%s VS %s %d:%d",n1,n2,&num1,&num2);
            int f1=find( n1 );
            int f2=find( n2 );
            if( num1==num2 ){
                team[ f1 ].score++;
                team[ f2 ].score++;
                team[ f1 ].win+=num1;
                team[ f1 ].lost+=num1;
                team[ f2 ].win+=num2;
                team[ f2 ].lost+=num2;
            }
            else if( num1>num2 ){
                team[ f1 ].win+=num1;
                team[ f1 ].lost+=num2;
                team[ f2 ].win+=num2;
                team[ f2 ].lost+=num1;
                team[ f1 ].score+=3;
            }
            else if( num1<num2 ){
                team[ f1 ].win+=num1;
                team[ f1 ].lost+=num2;
                team[ f2 ].win+=num2;
                team[ f2 ].lost+=num1;
                team[ f2 ].score+=3;
            }
        }
        for( int i=0;i<n;i++ ){
            team[ i ].diff=team[ i ].win-team[ i ].lost;
        }
        sort( team,team+n,cmp );
        for( int i=0;i<n;i++ ){
            printf("%s %d\n",team[i].name,team[i].score);
        }
        printf("\n");
    }
    return 0;
}