<font color="Pink">Tisfy的博客</font>

LeetCode 0714. 买卖股票的最佳时机含手续费给定一个整数数组 prices，其中 prices[i]表示第 i 天的股票价格 ；整数 fee 代表了交易股票的手续费用。你可以无限次地完成交易，但是你每笔交易都需要付手续费。如果你已经购买了一个股票，在卖出它之前你就不能再继续购买股票了。返回获得利润的最大值。注意：这里的一笔交易指买入持有并卖出股票的整个过程，每笔交易你只需要为支付一次手续费。

LeetCode 2251. 花期内花的数目：排序 + 二分给你一个下标从 0 开始的二维整数数组 flowers ，其中 flowers[i] = [starti, endi] 表示第 i 朵花的 花期 从 starti 到 endi （都 包含）。同时给你一个下标从 0 开始大小为 n 的整数数组 people ，people[i] 是第 i 个人来看花的时间。请你返回一个大小为 n 的整数数组 answer ，其中 answer[i]是第 i 个人到达时在花期内花的 数目 。

LeetCode 1333. 餐厅过滤器给你一个餐馆信息数组 restaurants，其中 restaurants[i] = [idi, ratingi, veganFriendlyi, pricei, distancei]。你必须使用以下三个过滤器来过滤这些餐馆信息。其中素食者友好过滤器 veganFriendly 的值可以为 true 或者 false，如果为 true 就意味着你应该只包括 veganFriendlyi 为 true 的餐馆，为 false 则意味着可以包括任何餐馆。此外，我们

LeetCode 2582. 递枕头：清晰的话讲述 O(1)的时间算法n 个人站成一排，按从 1 到 n 编号。最初，排在队首的第一个人拿着一个枕头。每秒钟，拿着枕头的人会将枕头传递给队伍中的下一个人。一旦枕头到达队首或队尾，传递方向就会改变，队伍会继续沿相反方向传递枕头。例如，当枕头到达第 n 个人时，TA 会将枕头传递给第 n - 1 个人，然后传递给第 n - 2 个人，依此类推。给你两个正整数 n 和 time ，返回 time 秒后拿着枕头的人的编号。

Codeforces Round 857 (Div. 2) - B. Settlement of Guinea Pigs - 题解Dasha loves guinea pigs very much. In this regard, she decided to settle as many guinea pigs at home as possible and developed a plan for the next n days. Every day, she will either buy a n

Codeforces Round #775 (Div. 2,based on Moscow Open Olympiad in Informatics) - D. Integral Array - 题解You are given an array a of n positive integers numbered from 1 to n. Let's call an array integral if for any two, not necessarily different, numbers x and

Codeforces Round #750 (Div. 2) - B. Luntik and Subsequences - 题解Luntik came out for a morning stroll and found an array a of length n. He calculated the sum s of the elements of the array (s=∑ni=1ai). Luntik calls a subsequence of the array a nearly full

题解 - 正好5000字Codeforces Round #749 (Div. 1 + Div. 2, based on Technocup 2022 Elimination Round 1)D. Omkar and the Meaning of LifeIt turns out that the meaning of life

万字长文（5731）Codeforces Round #749 (Div. 1 + Div. 2, based on Technocup 2022 Elimination Round 1)C. Omkar and DeterminationThe problem statement looms below, filling you with determination.Consider a grid in which some cells are empty and some cells are

Codeforces Round #749 (Div. 1 + Div. 2, based on Technocup 2022 Elimination Round 1)B. Omkar and Heavenly TreeLord Omkar would like to have a tree with n nodes (3≤n≤105) and has asked his disciples to construct the tree. However, Lord Omkar has created m

Codeforces Round #749(Div. 1+Div. 2, based on Technocup 2022 Elimination Round1)-A. Windblume Ode-题解Codeforces Round #749 (Div. 1 + Div. 2, based on Technocup 2022 Elimination Round 1)A. Windblume OdeA bow adorned with nameless flowers that bears the ea

Educational Codeforces Round 112 (Rated for Div. 2)-D. Say No to Palindromes-题解Let's call the string beautiful if it does not contain a substring of length at least 2, which is a palindrome. Recall that a palindrome is a string that reads the same way fro

Educational Codeforces Round 112 (Rated for Div. 2)-C. Coin Rows-题解Alice and Bob are playing a game on a matrix, consisting of 2 rows and m columns. The cell in the i-th row in the j-th column contains ai,j coins in it.Initially, both Alice and Bob are

Educational Codeforces Round 112 (Rated for Div. 2)-B. Two Tables-题解You have an axis-aligned rectangle room with width W and height H, so the lower left corner is in point (0,0) and the upper right corner is in (W,H).There is a rectangular table standin

Educational Codeforces Round 112 (Rated for Div. 2)-A. PizzaForces-题解PizzaForces is Petya's favorite pizzeria. PizzaForces makes and sells pizzas of three sizes: small pizzas consist of 6 slices, medium ones consist of 8 slices, and large pizzas consist o

Codeforces Round #735 (Div. 2)-C. Mikasa-题解You are given two integers n and m. Find the MEX of the sequence n⊕0,n⊕1,…,n⊕m. Here, ⊕ is the bitwise XOR operator.MEX of the sequence of non-negative integers is the smallest non-negative integer that doesn't

Codeforces Round #735 (Div. 2)-A. Cherry-题解You are given n integers a1,a2,…,an and an integer k. Find the maximum value of i⋅j−k⋅(ai|aj) over all pairs (i,j) of integers with 1≤i<j≤n. Here, | is the bitwise OR operator.InputThe first line contains a si

Codeforces Round #735 (Div. 2)-A. Cherry-题解You are given n integers a1,a2,…,an. Find the maximum value of max(al,al+1,…,ar)⋅min(al,al+1,…,ar) over all pairs (l,r) of integers for which 1≤l<r≤n.InputThe first line contains a single integer t (1≤t≤10000)

Codeforces Round #734 (Div. 3)-D2. Domino (hard version)The only difference between this problem and D1 is that you don't have to provide the wayThere's a table of $n \times m$ cells ($n$ rows and $m$ columns). The value of $n \cdot m$ is even.

Codeforces Round #734 (Div. 3)-D1. Domino (easy version)-题解Polycarp must pay **exactly** $n$ burles at the checkout. He has coins of two nominal values: $1$ burle and $2$ burles. Polycarp likes both kinds of coins equally. So he doesn't want to pay with m

目录Codeforces Round #734 (Div. 3)-C. Interesting StoryProblem DescriptionInputOutputSample InputSample OnputNote题目大意解题思路AC代码Codeforces Round #734 (Div. 3)-C. Interesting Story传送门Time Limit: 4 secondsMemory Limit: 256 megabytesProblem DescriptionSteph.

Codeforces Round #734 (Div. 3)-B2. Wonderful Coloring - 2-题解Polycarp must pay **exactly** $n$ burles at the checkout. He has coins of two nominal values: $1$ burle and $2$ burles. Polycarp likes both kinds of coins equally. So he doesn't want to pay with

Codeforces Round #734 (Div. 3)-B1. Wonderful Coloring - 1**This is a simplified version of the problem B2. Perhaps you should read the problem B2 before you start solving B1.**Paul and Mary have a favorite string $s$ which consists of lowercase letters o

Codeforces Round #734 (Div. 3)-A. Polycarp and Coins-题解<a href="https://codeforces.com/contest/1551/problem/A">传送门</a>**Time Limit**: 1 second**Memory Limit**: 256 megabytes### Problem DescriptionPolycarp must pay **exactly** $n$ burles at the check

Codeforces Round #717 (Div. 2)-B. Maximum Cost Deletion-题解Let's call an array a consisting of n positive (greater than 0) integers beautiful if the following condition is held for every i from 1 to n: either ai=1, or at least one of the numbers ai−1 and a

Codeforces Round #717 (Div. 2)-B. Maximum Cost Deletion-题解You are given a string s of length n consisting only of the characters 0 and 1.You perform the following operation until the string becomes empty: choose some consecutive substring of equal chara

Codeforces Round #717 (Div. 2)-C. Baby Ehab Partitions Again-题解Suppose you have two points p=(xp,yp) and q=(xq,yq). Let's denote the Manhattan distance between them as d(p,q)=|xp−xq|+|yp−yq|.Let's say that three points p, q, r f

目录Codeforces Round #717 (Div. 2)-C. Baby Ehab Partitions AgainProblem DescriptionInputOutputSample InputSample OnputNote题目大意输出描述解题思路AC代码Codeforces Round #717 (Div. 2)-C. Baby Ehab Partitions Again传送门Time Limit: 2 secondsMemory Limit: 256 megabytesProb

目录Codeforces Round #717 (Div. 2)-B. AGAGA XOOORRRProblem DescriptionInputOutputSample InputSample OnputNote题目大意解题思路AC代码Codeforces Round #717 (Div. 2)-B. AGAGA XOOORRR传送门Time Limit: 1 secondMemory Limit: 256 megabytesProblem DescriptionBaby Ehab is kn

目录Codeforces Round #717 (Div. 2)-A. Tit for TatProblem DescriptionInputOutputSample InputSample OnputNote题目大意题目分析AC代码Codeforces Round #717 (Div. 2)-A. Tit for Tat传送门Time Limit: 1 secondMemory Limit: 256 megabytesProblem DescriptionGiven an array aaa

目录Educational Codeforces Round 108 (Rated for Div. 2)-D. Maximum Sum of ProductsProblem DescriptionInputOutputSample InputSample OnputNote题目大意解题思路AC代码Educational Codeforces Round 108 (Rated for Div. 2)-D. Maximum Sum of Products传送门Time Limit: 2 seconds

目录Educational Codeforces Round 108 (Rated for Div. 2)-C. Berland RegionalProblem DescriptionInputOutputSample InputSample OnputNote题目大意输入描述题目分析AC代码Educational Codeforces Round 108 (Rated for Div. 2)-C. Berland Regional传送门Time Limit: 2 secondsMemory Lim

目录Educational Codeforces Round 108 (Rated for Div. 2)-B. The Cake Is a LieProblem DescriptionInputOutputSample InputSample OnputNote题目大意解题思路AC代码Educational Codeforces Round 108 (Rated for Div. 2)-B. The Cake Is a Lie传送门Time Limit: 2 secondsMemory Limit

目录Educational Codeforces Round 108 (Rated for Div. 2)-A. Red and Blue BeansProblem DescriptionInputOutputSample InputSample OnputNote题目大意解题思路AC代码Educational Codeforces Round 108 (Rated for Div. 2)-A. Red and Blue Beans传送门Time Limit: 1 secondMemory Limi

目录Codeforces Round #713 (Div. 3)-E. Permutation by SumProblem DescriptionInputOutputSample InputSample Onput题目大意解题思路AC代码Codeforces Round #713 (Div. 3)-E. Permutation by Sum传送门Time Limit: 2 secondsMemory Limit: 256 megabytesProblem DescriptionA permut

目录Codeforces Round #713 (Div. 3)-D. Corrupted ArrayProblem DescriptionInputOutputSample InputSample Onput题目大意解题思路例如AC代码Codeforces Round #713 (Div. 3)-D. Corrupted Array传送门Time Limit: 2 secondsMemory Limit: 256 megabytesProblem DescriptionYou are give

目录Codeforces Round #713 (Div. 3)-C. A-B PalindromeProblem DescriptionInputOutputSample InputSample Onput题目大意解题思路AC代码Codeforces Round #713 (Div. 3)-C. A-B Palindrome传送门Time Limit: 2 secondsMemory Limit: 256 megabytesProblem DescriptionYou are given a

目录Codeforces Round #713 (Div. 3)-B. Almost RectangleProblem DescriptionInputOutputSample InputSample Onput题目大意解题思路AC代码Codeforces Round #713 (Div. 3)-B. Almost Rectangle传送门Time Limit: 2 secondsMemory Limit: 256 megabytesProblem DescriptionThere is a s

目录Codeforces Round #713 (Div. 3)-A. Spy Detected!Problem DescriptionInputOutputSample InputSample Onput题目大意解题思路AC代码Codeforces Round #713 (Div. 3)-A. Spy Detected!传送门Time Limit: 2 secondsMemory Limit: 256 megabytesProblem DescriptionYou are given an a

目录Codeforces April Fools Day Contest 2021-B. DMCAInputOutputExampleInputOutPutInputOutPut题目大意题解另外样例分析AC代码Codeforces April Fools Day Contest 2021-B. DMCA传送门Time Limit: 1 secondsMemory Limit: 256 megabytesMany people are aware of DMCA – Digital Millenni