Codeforces Round #686 (Div. 3) 解题报告

Codeforces Round #686 (Div. 3)

A. Special Permutation

Description

让你输出$1$ ~ $n$的一个排列$a$，并满足$\forall i\in [1,n],a_i\ne i$

Tutorial

如果$n$为偶数直接倒序输出即可，否则将中间的数字与开头或结尾进行交换

Solution

#include <bits/stdc++.h>
using namespace std;
int main() {
   
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	int T;
	cin >> T;
	while (T--) {
   
		int n;
		cin >> n;
		if(n % 2 == 0)
			for (int i = n; i >= 1; --i) cout << i << " ";
		else {
   
			cout << n / 2 + 1 << " ";
			for (int i = n - 1; i >= 1; --i) {
   
				if (i == n / 2 + 1) cout << n << ' ';
				else cout << i << " ";
			}
		}
		cout << '\n';
	}
	return 0;
}

B. Unique Bid Auction

Description

给定一个长度为$n$的序列，让你找到其中出现次数为1中最小的那个数所在的下标

Tutorial

记录一下每个数出现的次数，然后找到次数为1中最小的那个即可

Solution

#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
int vis[maxn], a[maxn];
int main() {
   
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	int T;
	cin >> T;
	while (T--) {
   
		int n;
		cin >> n;
		int Min = 0x3f3f3f3f;
		for (int i = 1; i <= n; ++i) vis[i] = 0;
		for (int i = 1; i <= n; ++i) {
   
			int x;
			cin >> x;
			++vis[x];
			a[i] = x;
		}
		for (int i = 1; i <= n; ++i) {
   
			if (vis[i] == 1) {
   
				Min = i;
				break;
			}
		}
		if (Min >= 0x3f3f3f3f) {
   
			cout << -1 << '\n';
			continue;
		}
		for (int i = 1; i <= n; ++i) {
   
			if (a[i] == Min) cout << i << ' ';
		}
		cout << '\n';
	}
	return 0;
}

C. Sequence Transformation

Description

给定一个长度为$n$的序列，你需要选择一个序列中出现过的数字$x$，并删除所有不含有$x$的子序列，问你将序列变至只含有$x$的最小操作次数是多少

Tutorial

显然连续的相同数字对答案没有贡献，则首先将其从数组中去除，然后对于$a_i$，假设其总共出现了$m$次，则使得$x=a_i$的操作次数为
$$cn{t}_i=m-(a_1==a_i)-(a_{n^{\prime }}==a_i)$$
$O(n)$枚举即可

Solution

#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
int a[maxn], vis[maxn];
int main() {
   
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	int T