区间问题
狠人王
怀着一颗热情的心,追随自己的梦想!
展开
-
CodeForce 231C To Add or Not to Add(前缀和贪心)
A piece of paper contains an array of n integers a1, a2, …, an. Your task is to find a number that occurs the maximum number of times in this array. However, before looking for such number, you are al...原创 2019-07-30 15:53:32 · 153 阅读 · 0 评论 -
【codeforce】1208A(异或斐波那契数列规律) and 1208B Uniqueness(div1+div2)(尺取(two pointers))(二分)(区间缩小思维)
【A】 Cengiz recently learned Fibonacci numbers and now he is studying different algorithms to find them. After getting bored of reading them, he came with his own new type of numbers that he namedXOR...原创 2019-08-26 11:26:13 · 668 阅读 · 0 评论