Pagini recente » Borderou de evaluare (job #2100084) | Cod sursa (job #666488) | Cod sursa (job #198363) | Cod sursa (job #2761547) | Cod sursa (job #887703)
Cod sursa(job #887703)
#include<fstream>
#include<algorithm>
#define NMAX 1000002
using namespace std;
ifstream f("zombie.in");
ofstream g("zombie.out");
int d,n,k;
int dist[NMAX];
int res[NMAX];
int limit;
void read ( void )
{
f>>n>>d>>k;
limit=1;
for(int i(1); i <= n ; ++i )
{
f>>dist[i];
res[i]=res[i-1]+1;
while(dist[limit] < dist[i] - ( d-1 ) && dist[limit] )
limit++;
res[i]=min(res[i],res[limit-1]+k) ;
}
f.close();
}
void write ( void )
{
g<<res[n];
g.close();
}
int main()
{
read();
write();
return 0;
}