LA 4255 Guess

题目简单，错了很多次，哎不细心啊

《训练指南》P309

#include<cstdio>
#include<cstring>
#include<cmath>
#include<queue>
#include<vector>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;

const int MAXN = 17;
int x[MAXN];
int sum[MAXN][MAXN];
int d[MAXN];
int n;
char s[MAXN*MAXN];
bool vis[MAXN][MAXN];
bool inque[MAXN];
bool pre[MAXN];
bool eq[MAXN][MAXN];
bool bs[MAXN];

int main() {
	int T;
	scanf("%d", &T);
	while(T--) {
		scanf("%d", &n);
		scanf("%s", s);
		int i, j , k;
		memset(vis, 0 ,sizeof(vis));
		memset(d, -1, sizeof(d));
		memset(eq, 0, sizeof(eq));
		memset(pre, 0 , sizeof(pre));
		for(k=0, i = 1; i <= n; i++) {
			for(j = i; j <= n; j++, k++) {
				if(s[k] == '0') {
					sum[i][j] = 0;
					eq[i - 1][j]=eq[j][i - 1] = true;
				}
				else if(s[k] == '+') 	{
					sum[i][j] = 1;
					vis[i-1][j] = pre[j] = true;
				}
				else if(s[k] == '-') {
					sum[i][j] = -1;
					vis[j][i-1] = pre[i-1] = true;
				}
			}
		}
		int st = 0;
		for(i = 0 ; i <= n; i ++)
			if( !pre[i] ) {
				st = i;
				break;
			}
		queue<int> q;
		q.push(st);
		d[st] = 0;
		inque[st] = true;
		while(!q.empty()) {
			int u = q.front();
			q.pop(); inque[u] = false;
			for(i = 0; i <= n; i ++) {
				if(u != i && vis[u][i] && d[i] < d[u] + 1) {
					d[i] = d[u] + 1;
					if( !inque[i] ) {
						q.push(i);
						inque[i] = true;
					}
				}
			}
		}
		for(i = 0; i <= n; i++) {
			if(d[i] != -1) {
				for(j = 0; j <= n; j++) if(eq[i][j]) {
					if(d[j] < d[i]) d[j] = d[i];
					if(d[i] < d[j]) d[i] = d[j];
				}
			}
		}
		int nmax = -10, nmin = 10;
		for(i = 1; i <= n; i ++) {
			x[i] = d[i] - d[i-1];
			nmax = max(nmax, x[i]);
			nmin = min(nmin, x[i]);
		}
		if(nmax > 10) nmax = nmax - 10;
		else nmax = 0;
		if(nmin < -10) nmin = -10 - nmin;
		else nmin = 0;
		for(i = 1; i <= n; i ++)
			printf("%d ", x[i] - nmax + nmin);
		puts("");
	}
	return 0;
}