摘要：
Given a integers x = 1, you have to apply Q (Q ≤ 100000) operations: Multiply, Divide. Input First line of the input file contains an integer T(0 incl 阅读全文
摘要：
n个点(n include include include include include include include include include include include include include include include include include define m 阅读全文
摘要：
给你一个长度为 $\left|s\right|$ 的01串 $s$ ，每次操作你可以任选一个 $k$ ，使01串的 $[1,k]$ 和 $(k,\left|s\right|]$ 分别翻转（其中一个区间可以为空），求经过任意次操作后能得到的最长的01交替出现的子串的长度。（实际题目中01用w和b代替） 阅读全文
摘要：
"题目链接" 所有元素初始值为0才能这么做： ①l r全加1 a[l]++; a[r+1] ; 求一遍前缀和为元素本身。 求两遍前缀和为元素前缀和。 include include include include include include include include include inc 阅读全文