Set Traffic Lights | CSES Problem Set | Solution

 

CSES Problem Set

Traffic Lights

There is a street of length x$x$ whose positions are numbered 0,1,…,x$0,1,\dots ,x$. Initially there are no traffic lights, but n$n$ sets of traffic lights are added to the street one after another.

Your task is to calculate the length of the longest passage without traffic lights after each addition.

Input

The first input line contains two integers x$x$ and n$n$: the length of the street and the number of sets of traffic lights.

Then, the next line contains n$n$ integers p1,p2,…,pn$p_1,p_2,\dots ,p_n$: the position of each set of traffic lights. Each position is distinct.

Output

Print the length of the longest passage without traffic lights after each addition.

Constraints

• 1≤x≤109$1\le x\le {10}^9$
  
• 1≤n≤2⋅105$1\le n\le 2\cdot {10}^5$
  
• 0<pi<x$0<p_i<x$
  

Example

Input:
8 3
3 6 2

Output:
5 3 3




int x,n;

cin>>x>>n;

set<pii>s;

multiset<int>sz;

s.insert({1,x});

sz.insert(x);

for (int i = 0; i < n; i++)

{

    int q;

    cin>>q;

    auto it=s.upper_bound({q,INT_MAX});

    if(it!=s.begin())--it;

    pii p=*it;

        s.erase(it);

        s.insert({p.first,q});

        s.insert({q+1,p.second});

        auto itt=sz.find(p.second-p.first+1);

        sz.erase(itt);

        sz.insert(q-p.first+1);

        sz.insert(p.second-q);

        cout<<*sz.rbegin()<<" ";

}