Pagini recente » Cod sursa (job #715263) | Cod sursa (job #780138) | Cod sursa (job #2025777) | Cod sursa (job #914546) | Cod sursa (job #190198)
Cod sursa(job #190198)
#include<stdio.h>
int n,m,k,l,s,v[100010],ram;
int p[100010];
int caut(int x)
{
int p=1,q=m,mij,aux;
while(p<q)
{
mij=(p+q)>>1;
aux=v[x]/mij;
if(aux<=ram)
q=mij;
else
p=mij+1;
}
aux=v[x]/p;
if(aux>ram)
{
p++;
aux=v[x]/p;
}
ram=ram-aux;
return p;
}
int main()
{
freopen("progresii.in","r",stdin);
freopen("progresii.out","w",stdout);
scanf("%d%d%d%d",&n,&m,&k,&l);
int i,aux;
s=n;
for(i=1; i<=n; i++)
{
scanf("%d",&v[i]);
v[i]=l-v[i];
if(v[i]>0)
{
aux=v[i]/m;
p[i]=aux;
s+=aux;
}
}
ram=k-s;
if(ram==0)
{
for(i=1; i<=n; i++)
printf("%d\n",m);
return 0;
}
if(ram<0)
{
printf("-1\n");
return 0;
}
for(i=1; i<=n; i++)
{
ram+=p[i];
aux=caut(i);
printf("%d\n",aux);
}
for(int j=i; j<=n; j++)
printf("%d\n",m);
return 0;
}