Pagini recente » Cod sursa (job #1804652) | Cod sursa (job #2339437) | Cod sursa (job #2465587) | Cod sursa (job #1319939) | Cod sursa (job #1157210)
#include <fstream>
using namespace std;
ifstream f("progresii.in");
ofstream g("progresii.out");
long long n,v,l,d,sl;
long long pi[100100],sol[100100];
int main()
{
f>>n>>v>>l>>d;
for(int i=1;i<=n;++i)
{
f>>pi[i];
sol[i]=v;
sl+=(d-pi[i])/v+1;
}
if(sl-l>0)
{
g<<"-1";
return 0;
}
else
for(int i=1;i<=n;++i)
{
long long nr=sol[i],cnt=(1LL<<32);
sl-=(d-pi[i])/v+1;
for(;cnt>0;cnt>>=1)
if(nr-cnt>0)
if(sl+(d-pi[i])/(nr-cnt)+1<=l)
nr-=cnt;
sl+=(d-pi[i])/nr+1;
sol[i]=nr;
}
for(int i=1;i<=n;++i)
g<<sol[i]<<'\n';
return 0;
}