Pagini recente » Istoria paginii runda/hk | Cod sursa (job #543107) | Cod sursa (job #2285991) | Cod sursa (job #1128253) | Cod sursa (job #3301847)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("partitie.in");
ofstream fout("partitie.out");
const int dim = 300000 + 5;
int v[dim], sol[dim];
int main()
{
int n, i, j, m, k = 0;
fin >> n >> m;
for ( i = 1; i <= n; ++i )
fin >> v[i];
sort(v + 1, v + n + 1);
j = 2;
for ( i = 1; i <= n; ++i )
{
while ( j <= n && (sol[j] != 0 || v[j] < v[i] + m) )
++j;
// fout << " j = " << j << endl;
if ( j <= n )
{
if ( sol[i] == 0 )
sol[i] = ++k;
sol[j] = sol[i];
}
else
if ( sol[i] == 0 )
sol[i] = ++k;
}
fout << k << '\n';
for ( i = 1; i <= n; ++i )
fout << sol[i] << '\n';
return 0;
}