Cod sursa(job #759766)
| Utilizator | Data | 19 iunie 2012 09:37:21 | |
|---|---|---|---|
| Problema | Zombie | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream in("zombie.in");
ofstream out("zombie.out");
int N,d,k,dr,st;
int v[1000000];
void citire()
{
in>>N>>d>>k;
for(int i=1;i<=N;i++)
{
in>>v[i];
}
}
int main()
{
citire();
int cost[N];
dr=st=1;
while(dr<N)
{
while(v[dr]-v[st]>d)
{
st++;
}
if(cost[st-1]+k<cost[dr-1]+1)
{
cost[dr]=cost[st-1]+k;
}
else{
cost [dr]=cost [dr-1]+1;
}
dr++;
}
out<<cost [N-1];
return 0;
}
