110 lines
2.2 KiB
C++
110 lines
2.2 KiB
C++
/* Problem URL: https://cses.fi/problemset/task/1163 */
|
|
|
|
#include <bits/stdc++.h>
|
|
|
|
using namespace std;
|
|
|
|
#define V vector
|
|
|
|
#define rmin(a, b) a = min(a, b)
|
|
#define rmax(a, b) a = max(a, b)
|
|
|
|
#define rep(i, lim) for (size_t i = 0; i < (lim); i++)
|
|
#define nrep(i, s, lim) for (size_t i = s; i < (lim); i++)
|
|
|
|
#define repv(i, v) for (auto &i : (v))
|
|
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
|
|
#define sortv(v) sort(v.begin(), v.end())
|
|
#define all(v) (v).begin(), (v).end()
|
|
|
|
using vi = vector<int>;
|
|
using vvi = vector<vi>;
|
|
using vvvi = vector<vvi>;
|
|
using vvvvi = vector<vvvi>;
|
|
|
|
using ll = long long;
|
|
|
|
using vl = vector<ll>;
|
|
using vvl = vector<vl>;
|
|
using vvvl = vector<vvl>;
|
|
using vvvvl = vector<vvvl>;
|
|
|
|
template<class v>
|
|
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
|
|
os << vec[0];
|
|
for (size_t i = 1; i < vec.size(); i++) {
|
|
os << ' ' << vec[i];
|
|
}
|
|
os << '\n';
|
|
return os;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator>>(istream &is, vector<v> &vec)->istream& {
|
|
for (auto &i : vec) {
|
|
is >> i;
|
|
}
|
|
return is;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
|
|
for (auto &i : vec) {
|
|
os << i[0];
|
|
for (size_t j = 1; j < i.size(); j++) {
|
|
os << ' ' << i[j];
|
|
}
|
|
os << '\n';
|
|
}
|
|
return os;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator>>(istream &is, vector<vector<v>> &vec)->istream& {
|
|
for (auto &i : vec) {
|
|
for (auto &j : i) {
|
|
is >> j;
|
|
}
|
|
}
|
|
return is;
|
|
}
|
|
|
|
int main()
|
|
{
|
|
ios::sync_with_stdio(false);
|
|
cin.tie(nullptr);
|
|
|
|
multiset<ll> sizes;
|
|
set<pair<ll, ll>> ranges;
|
|
|
|
ll x;
|
|
int n;
|
|
cin >> x >> n;
|
|
|
|
sizes.insert(x + 1);
|
|
ranges.emplace(0, x);
|
|
|
|
while (n--) {
|
|
ll now;
|
|
cin >> now;
|
|
|
|
auto itr = prev(ranges.upper_bound({now, x + 1}));
|
|
auto [s, e] = *itr;
|
|
ranges.erase(itr);
|
|
sizes.erase(sizes.find(e - s + 1));
|
|
|
|
if (now >= s) {
|
|
ranges.emplace(s, now);
|
|
sizes.insert(now - s + 1);
|
|
}
|
|
if (now <= e) {
|
|
ranges.emplace(now, e);
|
|
sizes.insert(e - now + 1);
|
|
}
|
|
|
|
cout << *prev(sizes.end()) - 1 << ' ';
|
|
}
|
|
|
|
cout << '\n';
|
|
}
|