CodeforcesRound954(Div.3)题目列表：A.XAxisB.MatrixStabilizationC.UpdateQueriesD.MathematicalProblemE.BeautifulArrayF.Non-academicProblemG1.PermutationProblem(SimpleVersion)G2.PermutationProblem(HardVersion)A.XAxis题

CodeforcesRound954（Div.3）目录CodeforcesRound954（Div.3）\(C\).UpdateQueries\(D\).MathematicalProblem\(E\).BeautifulArray方法一：贪心+滑动窗口方法二：DP\(C\).UpdateQueries对索引数组\(ind\)去重排序对字符串\(c\)排序顺序遍历索引数组，将\(s[ind[i]

#include<bits/stdc++.h>#defineendl'\n'usingll=longlong;typedefunsignedlonglongull;usingnamespacestd;voidGordenGhost();signedmain(){#ifdefGordenfreopen("in.txt","rt",stdin);freopen

A.XAxis题意：给3个x轴上的点xi，我们要放置一个点到x轴上，到这3个点的距离最短。(1<=xi<=10)思路：直接暴力破解即可inta,b,c;inlineintcal(intx){ returnabs(x-a)+abs(x-b)+abs(x-c);}voidsolve(){ cin>>a>>b>>c; intans=(int)1e9; for