Pagini recente » Cod sursa (job #3195834) | Cod sursa (job #881588) | Cod sursa (job #881822) | Cod sursa (job #1501270) | Cod sursa (job #125113)
Cod sursa(job #125113)
//partitie
#include<fstream.h>
long int v2[300001];
int main()
{long int n,d,v[300001],i,j,p=0,k,a=0;
ifstream f("partitie.in");
ofstream g("partitie.out");
f>>n>>d;
f>>v[1]; v2[1]=1;p=1;
for(i=2;i<=n;i++)
{f>>v[i];
for(k=1;k<=p && v2[i]==0;k++)
{a=0;
for(j=1;j<i && a==0;j++)
if(v2[j]==k)
if(abs(v[j]-v[i])<d) a=1;
if(a==0) v2[i]=k;}
if(v2[i]==0) v2[i]=++p;
}
g<<p<<'\n';
for(i=1;i<=n;i++)
g<<v2[i]<<'\n';
f.close();
g.close();
return 0;
}