UVA 1423 Guess(拓扑排序)

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=10+5;
int degree[maxn],map[maxn][maxn],b[maxn],ans[maxn];
char s[maxn];
int n;
void topo()
{
    int vis[maxn];
    int count=0,low=-10;
    while(n+1!=count)
    {
        memset(vis,0,sizeof(vis));
        for(int i=0;i<=n;i++){
            if(degree[i]==0){
                degree[i]=-1;
                vis[i]=1;
                b[i]=low;
                count++;
            }
        }
        low++;
        for(int i=0;i<=n;i++){
            if(vis[i]){
                for(int j=0;j<=n;j++){
                    if(map[i][j]){
                        degree[j]--;
                    }
                }
            }
        }
    }
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        memset(degree,0,sizeof(degree));
        memset(map,0,sizeof(map));
        memset(b,0,sizeof(map));
        scanf("%d%s",&n,s);
        int k=0;
        for(int i=1;i<=n;i++){
            for(int j=i;j<=n;j++){
                if(s[k]=='+'){
                    map[i-1][j]=1;
                    degree[j]++;
                }
                if(s[k]=='-'){
                    map[j][i-1]=1;
                    degree[i-1]++;
                }
                k++;
            }
        }
        topo();
        for(int i=1;i<=n;i++) ans[i]=b[i]-b[i-1];
        for(int i=1;i<=n;i++) printf("%s%d",i==1?"":" ",ans[i]);printf("\n");
    }
    return 0;
}