Codeforces Round #290 (Div. 2) C. Fox And Names 拓扑排序

思路：对相邻两行，当s1[i]≠s2[i]时，新的字母表中s1[i]必须出现在s2[i]的前面，显然是拓扑排序。所以枚举相邻的两行，构造有向边统计入度。

拓扑排序：

每次从图中拿走一个入度为0的节点，并删除所有从该点出发的有向边。若最终输出的节点个数小于总个数，证明存在环。

代码如下：

#include <cstdio>
#include <cstring>
using namespace std;
#define N 105
char s[N][N], ans[27];
int head[26], degree[26];
struct Edge{
	int to, next;
}e[700];

int main(){
	int n;
	scanf("%d", &n);
	for(int i = 0; i < n; ++i)
		getchar(), scanf("%s", s[i]);
	int cnt = 0;
	bool failed = false;
	for(int i = 1; i < n && !failed; ++i){
		int len1 = strlen(s[i - 1]), len2 = strlen(s[i]);
		int j = 0;
		for(; j < len1 && j < len2; ++j){
			int u = s[i - 1][j] - 'a', v = s[i][j] - 'a';
			if(u == v)
				continue;
			++cnt;
			e[cnt].to = v, e[cnt].next = head[u], head[u] = cnt, ++degree[v];
			break;
		}
		if(j == len2 && j < len1)
			failed = true;
	}
	if(failed)
		printf("Impossible\n");
	else{
		memset(ans, 0, sizeof(ans));
		bool single;
		int idx = 0;
		do{
			single = false;
			for(int i = 0; i < 26 && !single; ++i){
				if(degree[i] == 0){
					single = true;
					ans[idx ++] = i + 'a';
					--degree[i];
					for(int j = head[i]; j != 0; j = e[j].next)
						--degree[e[j].to];
				}
			}
		}while(single);
		if(idx < 26)
			printf("Impossible\n");
		else
			printf("%s\n", ans);
	}
	return 0;
}