每日一题
文章平均质量分 61
sakura7776
文化先和初中生同步
展开
-
CF1560E 每日一题 Polycarp and String Transformation
Polycarp has a string s. Polycarp performs the following actions until the string s is empty (t is initially an empty string):he adds to the right to the string t the string s, i.e. he does t=t+s, where t+s is a concatenation of the strings t and原创 2023-02-20 14:42:08 · 209 阅读 · 0 评论 -
CF1787C 每日一题 Remove the Bracket dp
RSJ has a sequence a of n integers a1,a2,…,an and an integer s. For each of a2,a3,…,an−1, he chose a pair of non-negative integers xi and yi such that xi+yi=ai and (xi−s)⋅(yi−s)≥0.Now he is interested in the valueF=a1⋅x2+y2⋅x3+y3⋅x4+…+yn−2⋅xn−1原创 2023-02-10 11:24:15 · 279 阅读 · 0 评论 -
CF1744F 每日一题 MEX vs MED 思维,双指针
outputstandard outputYou are given a permutation p1,p2,…,pn of length n of numbers 0,…,n−1. Count the number of subsegments 1≤l≤r≤n of this permutation such that mex(pl,pl+1,…,pr)>med(pl,pl+1,…,pr).mex of S is the smallest non-negative integer th原创 2023-02-02 14:05:57 · 364 阅读 · 0 评论 -
CF1743D 每日一题 Problem with Random Tests
You are given a string s consisting of n characters. Each character of s is either 0 or 1.A substring of s is a contiguous subsequence of its characters.You have to choose two substrings of s (possibly intersecting, possibly the same, possibly non原创 2023-02-01 14:08:05 · 169 阅读 · 0 评论 -
CF1750D 每日一题 Count GCD
You are given two integers n and m and an array a of n integers. For each 1≤i≤n it holds that 1≤ai≤m.Your task is to count the number of different arrays b of length n such that:1≤bi≤m for each 1≤i≤n, andgcd(b1,b2,b3,...,bi)=ai for each 1≤i原创 2023-01-31 13:20:36 · 100 阅读 · 0 评论 -
CF1741E 每日一题 Sending a Sequence Over the Network
The sequence a is sent over the network as follows:sequence a is split into segments (each element of the sequence belongs to exactly one segment, each segment is a group of consecutive elements of sequence);for each segment, its length is written nex原创 2023-01-29 15:27:35 · 144 阅读 · 0 评论 -
CF1774D 每日一题 Same Count One
ChthollyNotaSeniorious received a special gift from AquaMoon: n binary arrays of length m. AquaMoon tells him that in one operation, he can choose any two arrays and any position pos from 1 to m, and swap the elements at positions pos in these arrays原创 2023-01-27 13:24:42 · 95 阅读 · 1 评论 -
CF1779D 每日一题 Boris and His Amazing Haircut
Boris thinks that chess is a tedious game. So he left his tournament early and went to a barber shop as his hair was a bit messy.His current hair can be described by an array a1,a2,…,an, where ai is the height of the hair standing at position i. His d原创 2023-01-26 12:08:11 · 239 阅读 · 0 评论 -
CF1765D 每日一题 Watch the Videos
Monocarp wants to watch n videos. Each video is only one minute long, but its size may be arbitrary. The i-th video has the size ai megabytes. All videos are published on the Internet. A video should be downloaded before it can be watched. Monocarp has原创 2023-01-25 16:54:22 · 209 阅读 · 0 评论