Pagini recente » Cod sursa (job #2496640) | Istoria paginii runda/coosmin | Istoria paginii runda/oni2011_9_2/clasament | Cod sursa (job #1100539) | Cod sursa (job #965536)
Cod sursa(job #965536)
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <vector>
using namespace std;
const int MAX_N = 50000;
int v[MAX_N],n,P,S;
int semn[MAX_N];
char show[MAX_N];
vector<int> plus;
vector<int> minus;
int get(vector<int> & now)
{
int ret = rand() % now.size();
swap(now[ret],now.back());
ret = now.back();
now.pop_back();
return ret;
}
int main()
{
srand(time(0));
freopen("semne.in", "r", stdin);
freopen("semne.out", "w", stdout);
scanf("%d%d",&n,&P);
int i;
for(i = 0 ; i < n ; ++ i){
scanf("%d",v+i);
if(i & 1){
semn[i] = 1;
S += v[i];
plus.push_back(i);
}else{
semn[i] = -1;
S -= v[i];
minus.push_back(i);
}
}
while(S != P){
if ( S < P)
i = get(minus);
else i = get(plus);
semn[i] *= -1;
S += 2 * semn[i] * v[i];
}
for(i = 0 ; i < n ; ++ i)
if(semn[i] == 1)
show[i] = '+';
else show[i] = '-';
printf("%s\n",show);
}