Pagini recente » Cod sursa (job #2905304) | Cod sursa (job #2420322) | Cod sursa (job #2668807) | Cod sursa (job #149493) | Cod sursa (job #1095054)
#include<fstream>
using namespace std;
int lungime,n,k,dp[1000010],v[1000010];
void citirensolve() {
ifstream in("zombie.in");
int i,j;
in>>lungime>>n>>k;
j=1;
for(i=1;i<=n;i++) {
in>>v[i];
while(v[i]-v[j]>lungime)
j++;
if(dp[i-1]+1<dp[j-1]+k)
dp[i]=dp[i-1]+1;
else
dp[i]=dp[j-1]+k;
}
in.close();
}
void afisare() {
ofstream out("zombie.out");
out<<dp[n]<<'\n';
out.close();
}
int main () {
citirensolve();
afisare();
return 0;
}