xingzi201的博客

文章目录A.Find The ArrayB.Maximum Cost DeletionC.Manhattan SubarraysD.Excellent ArraysE.StringforcesF.Jumping AroundA.Find The Array走你此题目就是个水题，签到题吧，就是数组里，一定要有该数字减1或者减2，所以只需要从1，一直加2，就是1,3,5等等，无论是多少可以保证，最后的余数都会与前面的某个数差1或者2，满足条件，这就是个等差数列的问题了，可以根据等差数列的公式做#i..

文章目录A.Polycarp and CoinsB.Wonderful Coloring - 1C.Wonderful Coloring - 2 *D.Interesting Story *E.Running for Gold*F.Backspace有部分题没做，之后会补的*A.Polycarp and Coins传送门这个题巨简单，太水了，就是找两个数，和等于你输入的那个数#include<iostream>#include<cstring>#include&l..

文章目录A. CherryA. Cherry传送门#include<iostream>#include<cstring>#include<algorithm>#include<cmath>using namespace std;const int Max=1e5+7;long long a[Max];int main(){ int t,i; cin>>t; while(t--) { ..

文章目录A.PizzaForcesB.Two Tables *C.Coin Rows *D.Say No to PalindromesE.Boring Segments *F.Good Graph *A.PizzaForces传送门这个题还是挺水的，就是找好之间的关系就好了，不多说了，上代码#include<iostream>#include<algorithm>#include<cmath>#include<cstring>#inclu..

文章目录A.Ezzat and Two SubsequencesB.Moamen and k-subarraysC.Moamen and XOR *D.Ezzat and Grid *E.Assiut Chess *A.Ezzat and Two Subsequences传送门思路：最大值加上剩下的平均数#include<iostream>#include<algorithm>#include<cmath>#include<cstring>..

文章目录A.Gregor and CryptographyB.Gregor and the Pawn GameC.Web of Lies*D.Integers Have Friends*E.The Three Little Pigs *F.Gregor and the Odd Cows (Easy) *G.Gregor and the Odd Cows (Hard) *A.Gregor and Cryptography传送门这个题挺水的，题目大意就是输入大于等于5的素数，输出两个数，素数对这两个..

文章目录A.Mocha and MathB.Mocha and Red and BlueC.Mocha and HikingD.Mocha and Diana (Easy Version) *E.Mocha and Diana (Hard Version) *F.Mocha and Stars*A.Mocha and Math传送门题目大意：输出若干次’&‘运算后的最小数思路：从头到尾&一遍，输出最后的值#include<iostream>#include&lt..

文章目录A.Mean InequalityB.I Hate 1111C.Potions (Easy Version)D.Potions (Hard Version)E.Oolimry and Suffix Array *F.Median Queries *A.Mean Inequality传送门题目大意：给你一列数，让你进行排列，要满足，两边的和的平均数不等于中间那个数思路：首先进行sort排序，因为是偶数个，将排序后的分为前后两部分，后面部分逆序，跟前部分交替输出就好#include&lt..

文章目录A.Dislike of ThreesB.Who's Opposite?C.Infinity TableD.Make a Power of Two *E.Nearest Beautiful Number (easy version) *F.Nearest Beautiful Number (hard version) *G.Pipes *A.Dislike of Threes传送门思路：这就是个水题，跑一遍就行，把能被3整除和最后一位是3的判断一下就行#include<iostr..

文章目录A.Array RearrangmentB.BlocksC.Light It Up *D.Cow and Friend *E.Friends and Gifts*F.加分二叉树 *A.Array Rearrangment传送门题目大意：输入n,m,两个序列长度都为n，存在某一种排序，使得两个序列都满足ai+bi<=m思路：两个都进行sort排序，一个最大的加另一个最小的，跑一遍，有一个>m就输出No#include<iostream>#include<..

文章目录A.Simply Strange SortB.Charmed by the Game *C.Deep Down BelowD.Up the Strip (simplified version) *E.Up the Strip *F.Bottom-Tier Reversals *G.Top-Notch Insertions *A.Simply Strange Sort传送门题目大意：有两种操作，一种是偶数只对偶数和他后面的进行判断，如果前面大，前后就进行交换，同理奇数也是这样，奇数跟偶数..

文章目录A.Sliding WindowB.Bad Hair DayC.Largest Rectangle in a HistogramD.Max Sum of Max-K-sub-sequenceE.Feel GoodF.Fence RepairG.Phone ListH.Xor SumI.Snowflake Snow SnowflakesA.Sliding Window题目：传送门可以参考这个大佬题目大意：就是个窗口问题，移动窗口，更新数据，输入数组数据，然后输入窗口大小，分别储存最小值和..

文章目录A.Coloring ContentionB.Jzzhu and Cities *C.Find them, Catch themD.Cube StackingE.胜利大逃亡(续) *F.Don't Get RookedG. Igor In the MuseumH.EightI.Remmarguts' Date *J.Nightmare ⅡA.Coloring Contention思路：最短路减1#include<iostream>#include<cstring&..