E2.cpp

#include<bits/stdc++.h>
using namespace std;
#define fo(i,n) for(i=0;i<n;i++)
#define fo2(i,start,end) for(i=start;i<=end;i++)
#define rfo(i,n) for(i=n-1;i>=0;i--)
#define lli long long int
#define ll long long int
#define deb(x) cout<<#x<<"="<<x<<endl
#define deb2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sortall(x) sort(all(x))
#define tr(it,a) for(auto it=a.begin(); it!=a.end();it++)
#define nl '\n'
#define PI 3.1415926535897932384626
#define mod 1000000007
typedef pair<int, int>	pii;
typedef pair<lli, lli>	pl;
typedef vector<int>		vi;
typedef vector<lli>		vl;
typedef vector<pii>		vpii;
typedef vector<pl>		vpl;
void solve(){
    int i,j;
    int n;
    cin>>n;
    string s;
    cin>>s;
    int freq[26],dig,pos,count=1,ans[n];
    memset(freq,-1,sizeof(freq));
    map<int,int> adj,vis;
    fo(i,n){
        dig=s[i]-'a';
        for(j=dig;j>=0;j--){
            if(freq[j]!=-1){
                pos=freq[j];
                adj[pos]=i;
                freq[j]=-1;
                break;
            }
        }
        freq[dig]=i;
    }
    fo(i,n){
        if(vis[i]){
            continue;
        }
        j=i;
        while(true){
            vis[j]=1;
            ans[j]=count;
            if(adj[j]==0){
                break;
            }
            j=adj[j];
        }
        count++;
    }
    cout<<count-1<<nl;
    fo(i,n){
        cout<<ans[i]<<" ";
    }cout<<nl;


}

int main(){
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t=1;
    // cin>>t;
    while(t--){
        solve();
    }
}