TOI19 Range

#include<bits/stdc++.h>
using namespace std;
struct A{
    int l,r,id;
    bool operator < (const A&o) const{
        if(l!=o.l)  return l>o.l;
        else        return r<o.r;
    }
};
vector<A > mountains;
int LIS[400010];
int ans[400010];
int main(){
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);
    int n;
    cin >> n;
    for(int i=1;i<=n;i++){
        int l,r;
        cin >> l >> r;
        mountains.push_back({l,r,i});
    }
    sort(mountains.begin(),mountains.end());
    int mx = 0;
    for(int i=0;i<n;i++){
        int idx = upper_bound(LIS,LIS+mx,mountains[i].r)-LIS;
        if(idx == mx)   mx++;
        ans[mountains[i].id] = idx+1;
        LIS[idx] = mountains[i].r;
    }
    cout << mx << '\n';
    for(int i=1;i<=n;i++)
        cout << ans[i] << ' ';
    return 0;
}