Pagini recente » Cod sursa (job #1566527) | Cod sursa (job #452327) | Cod sursa (job #1638841) | Cod sursa (job #687093) | Cod sursa (job #2798461)
#include <fstream>
#include <deque>
using namespace std;
const int N = 5e4 + 5;
int v[N];
deque<int> a, b;
char ans[N];
int main() {
ios_base::sync_with_stdio(false);
ifstream cin("semne.in");
ofstream cout("semne.out");
cin.tie(nullptr), cout.tie(nullptr);
int n;
long long s, sa, sb;
cin >> n >> s;
sa = sb = 0;
for (int i = 0; i < n; ++i) {
cin >> v[i];
sa += v[i];
a.push_back(i);
}
cin.close();
while (sa - sb != s) {
if (sa - sb > s) {
sa -= v[a.back()], sb += v[a.back()];
b.push_front(a.back());
a.pop_back();
} else {
sa += v[b.back()], sb -= v[b.back()];
a.push_front(b.back());
b.pop_back();
}
}
for (auto i : a)
ans[i] = '+';
for (auto i : b)
ans[i] = '-';
cout << ans << "\n";
cout.close();
return 0;
}