Cod sursa(job #1852667)
Utilizator | Data | 21 ianuarie 2017 01:19:17 | |
---|---|---|---|
Problema | Progresii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.61 kb |
#include <bits/stdc++.h>
#define Nmax 100005
using namespace std;
int n,m;
long long k,L,d[Nmax],sum[Nmax];
int main()
{
int i;
long long x;
ifstream cin("progresii.in");
ofstream cout("progresii.out");
cin>>n>>m>>k>>L;
for(i=1;i<=n;++i)
{
cin>>d[i]; d[i]=L-d[i];
}
for(i=n;i;--i)
{
sum[i]=sum[i+1]+d[i]/m+1;
if(sum[i]>k)
{
cout<<"-1\n";
return 0;
}
}
for(i=1;i<=n;++i)
{
x=d[i]/(k-sum[i+1])+1;
cout<<x<<"\n";
k-=d[i]/x + 1;
}
return 0;
}