Cod sursa(job #638637)
| Utilizator | Data | 21 noiembrie 2011 10:37:43 | |
|---|---|---|---|
| Problema | Zombie | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.37 kb |
#include <fstream>
#define DN 1000005
using namespace std;
int d,n,k,t[DN],bst[DN],ls;
int main()
{
ifstream f("zombie.in");
ofstream g("zombie.out");
f>>d>>n>>k;
for(int i=1; i<=n; ++i) f>>t[i];
bst[1]=ls=1;
for(int i=2; i<=n; ++i) {
bst[i]=bst[i-1]+1;
for(;t[i]-t[ls]>d-1;++ls);
bst[i]=min(bst[i],bst[ls-1]+k);
}
g<<bst[n]<<'\n';
return 0;
}
