![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
思维
文章平均质量分 56
kingo233
这个作者很懒,什么都没留下…
展开
-
eoj3294
WiFi题面:eoj3284 WiFi思路我们假设第i个wifi发射器的位置和发射的信号强度为posi,vali,x为询问的坐标x我们要求的是val - |x- pos| 的最大值,做一个代数变形就是val - x + pos 或者 val + x - pos 的最大值令p = val - | x - pos |对于x左边的WiFi发射器,有x-pos >= 0p = val - x + pos ,那么我们只需二分查找找到x >= pos的点在按(val+p.原创 2021-02-06 21:09:47 · 196 阅读 · 0 评论 -
Nesting Depth
Google Code Jam Qualification Round 2020C 题 Nesting Depth题目链接(需要科技)题干Given a string of digits S, insert a minimum number of opening and closing parentheses into it such that the resulting string i...原创 2020-04-08 15:08:53 · 454 阅读 · 0 评论 -
Anu-Has-a-Function
CodeForces Round # 618 div2 C题Anu Has a Function题干Anu has created her own function f:f(x,y)=(x∣y)−yf : f(x,y)=(x|y)−yf:f(x,y)=(x∣y)−y where || | denotes the bitwise OR operation. For example,f(11,...原创 2020-03-19 19:50:42 · 196 阅读 · 0 评论 -
Bad Ugly Numbers
Codeforces Global Round 7题干You are given a integer n (n>0). Find any integer s which satisfies these conditions, or report that there are no such numbers:In the decimal representation of s:s>...原创 2020-03-20 10:47:24 · 142 阅读 · 0 评论