一道很好的题,以大小关系来表示方向建立图模型,而后利用拓扑排序,可以求出一组解,需要注意的是,用相等关系,这点需要预先处理以消除。
#include <iostream>
#include <limits>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;
const int size = 10 + 5;
int G[size][size];
char buffer[size * size];
int cur;
int B[size] , UF[size];
int Top[size] , vis[size];
int dfs(int n , int ts)
{
vis[UF[n]] = -1;
for(int x = 0 ; x <= ts ; ++x)
{
if(G[UF[n]][UF[x]])
{
if(vis[UF[x]] == -1) return 0;
if(!vis[UF[x]] && !dfs(x , ts)) return 0;
}
}
vis[UF[n]] = 1; Top[--cur] = UF[n];
return 1;
}
int topsort(int n)
{
cur = n;
memset(vis , 0 , sizeof(vis));
for(int x = 0 ; x <= n ; ++x)
{
if(!vis[UF[x]])
{
if(!dfs(x , n)) return 0;
}
}
return 1;
}
int main()
{
int T;
scanf("%d" , &T);
while(T-- > 0)
{
int n;
scanf("%d" , &n);
scanf("%s" , buffer);
memset(G , 0 , sizeof(G));
for(int i = 0 ; i <= n ; ++i) UF[i] = i;
for(int i = 1 ; i <= n ; ++i)
{
for(int j = i ; j <= n ; ++j)
{
int t = (2 * n + 2 - i) * (i - 1) / 2 + j - i;
if(buffer[t] == '0')
{
UF[j] = UF[i-1];
}
}
}
for(int i = 0 ; i <= n ; ++i)
{
int a , b = i;
do{
a = b;
b = UF[a];
}while(a != b);
UF[i] = a;
}
for(int i = 1 ; i <= n ; ++i)
{
for(int j = i ; j <= n ; ++j)
{
int t = (2 * n + 2 - i) * (i - 1) / 2 + j - i;
if(buffer[t] == '0') continue;
if(buffer[t] == '+') G[UF[i-1]][UF[j]] = 1;
else G[UF[j]][UF[i-1]] = 1;
}
}
topsort(n+1);
int tc = find(Top + cur , Top + n + 1 , UF[0]) - Top;
for(int i = cur ; i <= n ; ++i)
{
B[Top[i]] = i - tc;
}
for(int i = 0 ; i<=n ; ++i)
{
B[i] = B[UF[i]];
}
for(int i = 1 ; i < n ; ++i)
printf("%d " , B[i] - B[i-1]);
printf("%d\n" , B[n] - B[n-1]);
}
return 0;
}