Cod sursa(job #2085317)
| Utilizator | Data | 9 decembrie 2017 22:13:28 | |
|---|---|---|---|
| Problema | Zombie | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
int dp[1000001],v[1000001];
int main()
{
ifstream cin ("zombie.in");
ofstream cout ("zombie.out");
int d,n,k,j=1;
cin>>d>>n>>k;
for(int i=1;i<=n;i++)
{
cin>>v[i];
}
for(int i=1;i<=n;i++)
{
int j=0;
while(v[i]-v[j]>=d)
{
j++;
}
dp[i]=min(dp[i-1]+1,k+dp[j-1]);
}
cout<<dp[n];
return 0;
}
