UVA 200 (拓扑排序)

没加换行引发的一场悲剧呀

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<map>
#include<vector>
#include<cmath>
#include<cstdlib>
#include<list>
#include<queue>
#define mm(a,b) memset(a,b,sizeof(a))
#define ACCELERATE (ios::sync_with_stdio(false),cin.tie(0))
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
using namespace std;

char str[99999][20];

int main()
{
    int len=0;
    bool g[30][30];
    bool book[30];
    int idx[30];
    mm(g,0);
    mm(book,0);
    mm(idx,0);
    while(scanf("%s",str[len++])!=EOF&&strcmp("#",str[len-1])!=0){}
    len--;
    for(int i=0;i<len;i++){
        for(int j=i+1;j<len;j++){
            int minlen=min(strlen(str[i]),strlen(str[j]));
            for(int k=0;k<minlen;k++){
                if(str[i][k]!=str[j][k]){
                    g[str[i][k]-'A'][str[j][k]-'A']=1;
                    break;
                }
            }
        }
    }
    for(int i=0;i<26;i++){
        for(int j=0;j<26;j++){
            if(g[i][j]==1){
                book[i]=book[j]=1;
                idx[j]++;
            }
        }
    }
    queue<int> q;
    for(int i=0;i<26;i++){
        if(book[i]&&idx[i]==0) q.push(i);
    }
    while(!q.empty()){
        int t=q.front();
        q.pop();
        printf("%c",t+'A');
        for(int i=0;i<26;i++){
            if(g[t][i]){
                idx[i]--;
                if(idx[i]==0&&book[i]) q.push(i);
            }
        }
    }
    putchar(10);
    return 0;
}
/*
XWY
ZX
ZXY
ZXW
YWWX
#
*/