Cod sursa(job #125479)
| Utilizator | Data | 20 ianuarie 2008 12:59:23 | |
|---|---|---|---|
| Problema | Partitie | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | preONI 2008, Runda 3, Clasa a 9-a | Marime | 0.63 kb |
#include <fstream.h>
#include <math.h>
ifstream f ("partitie.in");
ofstream g ("partitie.out");
long int n,a[300],d,v[150],m;
void citire ()
{
f>>n>>d;
long int i;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++)
v[i]=1;
}
void procesare ()
{
long int i,j;
int urm=2;
for(i=1;i<=n;i++){
for(j=1;j<i;j++)
if(abs(a[j]-a[i])>=d){
v[i]=v[j];
}
else{
v[i]=v[j]+1;
m=v[i];
j=i;
}
}
}
int main ()
{
citire ();
procesare ();
g<<m;
long int i;
for(i=1;i<=n;i++)
g<<v[i]<<endl;
return 0;
}
