Pagini recente » Cod sursa (job #1262153) | Cod sursa (job #2045220) | Cod sursa (job #3004006) | Cod sursa (job #2388091) | Cod sursa (job #3194598)
#include <fstream>
#include <set>
using namespace std;
ifstream fin ("partitie.in");
ofstream fout ("partitie.out");
int n,k,i,x,fr[300001],nr;
pair <int,int> p;
set <pair<int,int>> s;
set <pair<int,int>>::iterator it;
int main()
{
fin>>n>>k;
for (i=1; i<=n; i++)
{
fin>>x;
s.insert (make_pair (x,i));
}
nr=0;
while (!s.empty ())
{
p=*s.begin ();
fr[p.second]=++nr;
p=make_pair (p.first+k,0);
s.erase (s.begin ());
while ((it=s.lower_bound (p))!=s.end ())
{
p=*it;
fr[p.second]=nr;
p=make_pair (p.first+k,0);
s.erase (it);
}
}
fout<<nr<<"\n";
for (i=1; i<=n; i++)
fout<<fr[i]<<"\n";
return 0;
}