fpjsi9 - Online C++0x Compiler & Debugging Tool

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define fi first
#define se second
#define pb push_back
#define all(v) v.begin(),v.end()
#define mk make_pair
typedef pair<int,int> pii;
const int maxn=1e6,MOD=1e9+7,INF=1e18;
int a[maxn],b[maxn];
vector<int> adj[maxn];
int32_t main(){
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    int n,k;
    cin >> n >> k;
    for(int i=1;i<=k;i++){
        cin >> b[i];
    }
    for(int i=0;i<=n;i++){
        adj[i].pb(i);
        a[i] = i;
    }
    int l=0,r=n;
    for(int i=1;i<=k;i++){
        if((a[b[i]]-l) <= (r-a[b[i]])){
            int d = 1;
            for(int j=a[b[i]]-1;j>=l;j--){
                for(int u : adj[j]){
                    adj[a[b[i]]+d].pb(u);
                    a[u] = a[b[i]] + d;
                }
                adj[j].clear();
                d++;
            }
            l = a[b[i]];
        }else{
            int d = 1;
            for(int j=a[b[i]]+1;j<=r;j++){
                for(int u : adj[j]){
                    adj[a[b[i]]-d].pb(u);
                    a[u] = a[b[i]] - d;
                }
                adj[j].clear();
                d++;
            }
            r = a[b[i]];
        }
    }
    vector<int> ans;
    for(int i=0;i<=n;i++){
        if(!adj[i].empty()){
            ans.pb((int)adj[i].size());
        }
    }
    cout << (int)ans.size() << '\n';
    for(int u : ans) cout << u << " ";
    return 0;
}