UVa OJ 1423 Guess

题意：一个长为n(n<=10)的整数序列，告诉你告诉你所有连续子集元素和的正、负、零情况，让你找出一个这样的序列。

方法：前缀和Prefix Sum，拓扑排序

利用前缀和，如果[i, j] 内元素之和为负，就给引一条边Si-1 -> Sj；若为正则连边Sj -> Si-1；如果为零则合并Si-1, Sj。最后找出S序列的拓扑排序，依次从大到小给S赋值就好了。因为题目中说明给定的关系矩阵是合法的，那么我们在求解的时候可以省去很多麻烦（即不用去考虑是否存在拓扑排序的解；S之间只要相对关系合理即可，不用担心S0是否不为0）。可以先进行合并点的操作，减少麻烦。

Code:

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <bitset>
#include <cstdlib>
#include <cmath>
#include <set>
#include <list>
#include <deque>
#include <map>
#include <queue>
#include <fstream>
#include <cassert>

#include <cmath>
#include <sstream>
#include <time.h>
#include <complex>
#define Max(a,b) ((a)>(b)?(a):(b))
#define Min(a,b) ((a)<(b)?(a):(b))
#define FOR(a,b,c) for (int (a)=(b);(a)<(c);++(a))
#define FORN(a,b,c) for (int (a)=(b);(a)<=(c);++(a))
#define DFOR(a,b,c) for (int (a)=(b);(a)>=(c);--(a))
#define FORSQ(a,b,c) for (int (a)=(b);(a)*(a)<=(c);++(a))
#define FORC(a,b,c) for (char (a)=(b);(a)<=(c);++(a))
#define FOREACH(a,b) for (auto &(a) : (b))
#define rep(i,n) FOR(i,0,n)
#define repn(i,n) FORN(i,1,n)
#define drep(i,n) DFOR(i,n-1,0)
#define drepn(i,n) DFOR(i,n,1)
#define MAX(a,b) a = Max(a,b)
#define MIN(a,b) a = Min(a,b)
#define SQR(x) ((LL)(x) * (x))
#define Reset(a,b) memset(a,b,sizeof(a))
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(v) v.begin(),v.end()
#define ALLA(arr,sz) arr,arr+sz
#define SIZE(v) (int)v.size()
#define SORT(v) sort(all(v))
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr,sz) sort(ALLA(arr,sz))
#define REVERSEA(arr,sz) reverse(ALLA(arr,sz))
#define PERMUTE next_permutation
#define TC(t) while(t--)
#define forever for(;;)
#define PINF 1000000000000
#define newline '\n'

#define test if(1)if(0)cerr
using namespace std;

using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
typedef pair<double,double> dd;
typedef pair<char,char> cc;
typedef vector<ii> vii;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> l4;
const double pi = acos(-1.0);

const int maxn = 11;
vector<int> g[maxn];
int sum[maxn];
int id[maxn];
int n;
const int UNDEFINED = -100000;
int state[maxn];
vector<int> order;
void dfs(int cur)
{
    state[cur] = 1;
    for (auto nxt : g[cur])
    {
        if (!state[nxt]) dfs(nxt);
    }
    order.pb(cur);
}
void toposort()
{
    Reset(state, 0);
    order.clear();
    rep(i, n+1) if (!state[id[i]]) dfs(id[i]);
    int val = 0;
    for (int i = order.size()-1; i >= 0; --i)
        sum[order[i]] = val--;
}
void input()
{
    cin >> n;
    rep(i, n+1)   id[i] = i;
    rep(i, n+1)   g[i].clear();
    string line;    cin >> line;
    int ptr = 0;
    repn(i, n)   rep(j, n-i+1)
    {
        if (line[ptr] == '0')
        {
            id[i+j] = id[i-1];
        }
        ++ptr;
    }
    ptr = 0;
    repn(i, n) rep(j, n-i+1)
    {
        if (line[ptr] == '+')
        {
            g[id[i+j]].pb(id[i-1]);
        }
        else if (line[ptr] == '-')
        {
            g[id[i-1]].pb(id[i+j]);
        }
        ++ptr;
    }
}
int main()
{
    int T;  cin >> T;
    repn(kase, T)
    {
        input();
        toposort();
        bool first = true;
        repn(i, n)
        {
            if (first) first = false;
            else cout << " ";
            cout << sum[id[i]]-sum[id[i-1]];
        }
        cout << newline;
    }
}

/*
 2
 5 
 1 2
 2 3
 3 4
 4 5
 5 6
 5 
 2 1
 2 2
 3 4
 3 1
 2 4
*/