模拟题（贪心+思维

A. Meximum Array
code：

#include<bits/stdc++.h>
#define endl '\n'
#define ll long long
#define ull unsigned long long
#define ld long double
#define all(x) x.begin(), x.end()
#define eps 1e-6
using namespace std;
const int maxn = 2e6 + 9;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
ll n, m;
int a[maxn];
int cnt[maxn];
void work()
{
	cin >> n;
	for(int i = 0; i <= n; ++i) cnt[a[i]] = 0;
	for(int i = 1; i <= n; ++i) cin >> a[i], cnt[a[i]] += 1;
	int l = 1;
	vector <int> v;
	while(l <= n)
	{
		int mex = 0;
		while(cnt[mex]) mex++;
		vector <bool> vis(mex + 1);
		int c = 0;
		while(l <= n)
		{
			if(a[l] < mex && !vis[a[l]]){
				vis[a[l]] = 1;
				c += 1;
			}
			cnt[a[l]]--;
			++l;
			if(c == mex) break;
		}
		v.push_back(mex);
	}
	cout << v.size() << endl;
	for(auto x : v) cout << x << " ";cout << endl;
}

int main()
{
	ios::sync_with_stdio(0);
	int TT;cin>>TT;while(TT--)
	work();
	return 0;
}

B - Reserve or Reverse
code：

#include<bits/stdc++.h>
#define endl '\n'
#define ll long long
#define ull unsigned long long
#define ld long double
#define all(x) x.begin(), x.end()
#define eps 1e-6
using namespace std;
const int maxn = 2e6 + 9;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
ll n, m;
vector <int> v[26];
string s;

void work()
{
	cin >> n >> s;
	for(int i = 0; i < s.size(); ++i)
		v[s[i]-'a'].push_back(i);
	int l = 0, r = n - 1;
	while(l < r)
	{
		int p = 0;
		while(p < 26)
		{
			while(!v[p].empty() && v[p].back() > r) v[p].pop_back();
			if(v[p].empty() || v[p].back() < l) ++p;
			else break;
		}
		if(s[l] - 'a' == p){
			++l;continue;
		}
		r = v[p].back();
		swap(s[l], s[r]);
		++l;
		--r;
	}
	cout << s;
}

int main()
{
	ios::sync_with_stdio(0);
//	int TT;cin>>TT;while(TT--)
	work();
	return 0;
}

「Nhk R1 D」Apocryphal Vir Pulcher
思路：
题解
开 $n$ 个队列，每次用最小值拓展
每次拓展只能从 $[pos,n]$，否则会出现重复
例如：
$n=3,a_1=3,a_2=4,a_3=5$
第一小的是 $0$，选出来拓展 $q_1=3,q_2=4,q_3=5$
第二小是 $3$，然后拓展 $q_1=6,q_2=4,7,q_3=5,8$
第三小是 $4$，然后拓展 $q_1=6,q_2=7,8,q_3=5,8,9$
如果第三次拓展从 $1$ 开始，那么 $q_1=6,7,q_2=7,8,q_3=5,8,9$
事实上这里 $q_1$ 和 $q_2$ 对于的数列 $c$ 都是 $1,1,0$，也就发生了重复
code：

#include<bits/stdc++.h>
#define endl '\n'
#define ll long long
#define ull unsigned long long
#define ld long double
#define all(x) x.begin(), x.end()
#define eps 1e-6
using namespace std;
const int maxn = 2e6 + 9;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
ll n, m;
queue <ll> q[89];
int a[maxn];

void work()
{
	cin >> n >> m;
	for(int i = 1; i <= n; ++i) cin >> a[i];
	sort(a + 1, a + 1 + n);
	q[1].push(0);
	ll Min, pos;
	for(int i = 1; i <= m; ++i)
	{
		Min = INF, pos = -1;
		for(int j = 1; j <= n; ++j){
			if(!q[j].empty() && q[j].front() < Min){
				Min = q[j].front();
				pos = j;
			}
		}	
		q[pos].pop();
		for(int j = pos; j <= n; ++j) q[j].push(Min + a[j]);
	}	
	cout << Min << endl;
}

int main()
{
	ios::sync_with_stdio(0);
//	int TT;cin>>TT;while(TT--)
	work();
	return 0;
}