Educational Codeforces Round 76题解报告题目链接A、Two Rival StudentsB、Minimize the PermutationC、Dominated SubarrayD、Yet Another Monster Killing ProblemE、The ContestF、Make Them Similar
题目链接A、Two Rival Students【题意、思路、解题过程】题意大概是长度为n的路，可以将相邻两个数交换至多k次，问两个人最远距离是多少。思路就是尽量把两个人往两把放即可，水题。#include<bits/stdc++.h>using namespace std;#define ll long longint main(){ int n,t,k,a,b; cin >> t; while(t--) {
