Pagini recente » Cod sursa (job #322173) | Cod sursa (job #927662) | Cod sursa (job #1062265) | Cod sursa (job #1803981) | Cod sursa (job #2354601)
#include<fstream>
using namespace std;
ifstream f("progresii.in");
ofstream g("progresii.out");
int v[100002],s[100002];
int main()
{
long long n,vmax,k,l,x,y,i;
f>>n>>vmax>>k>>l;
for(i=1;i<=n;i++)
f>>v[i],v[i]=l-v[i]+1;
for(i=n;i>=1;i--)
s[i]=s[i+1]+v[i]/vmax+(v[i]%vmax!=0);
if(s[1]>k)
g<<-1;
else
{
for(i=1;i<=n;i++)
{
x=k-s[i+1];
y=v[i]/x+(v[i]%x!=0);
g<<y<<'\n';
k-=v[i]/y+(v[i]%y!=0);
}
}
return 0;
}