题目链接:https://vjudge.net/contest/180830#problem/F
题意:给定一个长度为(n + 1) / 2的串一次表示sum(i,j)的正负,1 <= i <= j <= n。给是num[1] ~ num[n]赋合适的值使其满足该字符串中表示的大小关系。
思路:对区间和sum进行拓扑排序。设sum[x]为1~x的和,若sum(i,j) > 0则表示sum[j] - sum[i - 1] > 0即sum[j] > sum[i -1];若sum(i,j) < 0则表示sum[j] < sum[i - 1]。最后对sum赋好值后num[i] = num[i] - num[i - 1]。题目说num值在[-10,10]之间,那么对sum赋值时也在[-10,10]之间即可。稍微需要注意的是赋值时sum(i,j) = 0的条件也得满足,详细见代码。
代码如下:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<cstdlib>
#include<sstream>
#include<deque>
#include<stack>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double eps = 1e-6;
const int maxn = 30 + 20;
const int maxt = 300 + 10;
const int mod = 10;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const int Dis[] = {-1, 1, -5, 5};
const int inf = 0x3f3f3f3f;
const int MOD = 1000;
int n, m, k;
int sum[maxn];
int num[maxn];
vector<int> g[maxn];
int du[maxn];
int vis[maxn];
void toposort(){
memset(vis, false, sizeof vis);
queue<int> q;
int x = 10;
for(int i = 0; i <= n; ++i){
if(!du[i]){
q.push(i);
sum[i] = x;//度同时为0的赋值为相同的值,这样可以保证sum(i,j) = 0的情况成立
vis[i] = true;
}
}
--x;
int u, v;
while(!q.empty()){
u = q.front(); q.pop();
for(int i = 0; i < g[u].size(); ++i){
v = g[u][i];
if(vis[v]) continue;
--du[v];
if(!du[v]){
q.push(v);
vis[v] = true;
sum[v] = x;//度同时为0的赋值为相同的值
}
}
--x;
}
}
int main(){
int t;
scanf("%d", &t);
string s;
while(t--){
for(int i = 0; i < maxn; ++i) g[i].clear();
memset(du, 0, sizeof du);
scanf("%d", &n);
cin >> s;
int len = s.size();
int cnt = 0;
int u, v;
for(int i = 1; i <= n; ++i){
for(int j = i; j <= n; ++j){
if(s[cnt] == '0'){
++cnt; continue;
}
if(s[cnt] == '+'){
u = j; v = i - 1;
}
else if(s[cnt] == '-'){
u = i - 1; v = j;
}
g[u].push_back(v);
++du[v];
++cnt;
}
}
toposort();
for(int i = 1; i <= n; ++i){
num[i] = sum[i] - sum[i - 1];
}
for(int i = 1; i <= n; ++i){
if(i != 1) printf(" ");
printf("%d", num[i]);
}
printf("\n");
}
return 0;
}
/*
3
4
-+0++++--+
2
+++
5
++0+-+-+--+-+--
*/