Codeforces
文章平均质量分 61
CF
向上的yyy
路漫漫其修远兮,吾将上下而求索
展开
-
B. Kill Demodogs——模拟+数学公式推导
B. Kill Demodogs——模拟+数学公式推导。原创 2023-01-06 21:57:59 · 405 阅读 · 1 评论 -
A. Joey Takes Money——贪心
Codeforces Round #841 (Div. 2) and Divide by Zero 2022 A. Joey Takes Money——贪心。原创 2023-01-06 16:16:12 · 382 阅读 · 0 评论 -
B. Quick Sort——模拟
Codeforces Round #842 (Div. 2) B. Quick Sort——模拟。原创 2023-01-06 15:28:36 · 387 阅读 · 0 评论 -
D. Challenging Valleys
You are given an array a[0…n−1] of n integers. This array is called a “valley” if there exists exactly one subarray a[l…r] such that:0≤l≤r≤n−1,al=al+1=al+2=⋯=ar,l=0 or al−1>al,r=n−1 or ar原创 2022-11-22 15:48:21 · 770 阅读 · 0 评论 -
E. Binary Inversions——前缀+后缀
You are given a binary array† of length n. You are allowed to perform one operation on it at most once. In an operation, you can choose any element and flip it: turn a 0 into a 1 or vice-versa.What is the maximum number of inversions‡ the array can have af原创 2022-11-22 15:48:27 · 859 阅读 · 2 评论