A.CuttingBanner枚举切掉中间部分匹配[crayon-688cfcebc3d99290362615/]B.QuasiBinary用最少的只包含01的数凑出n每次贪心在非0位上取1[crayon-688cfcebc3da2700594520/]C.Tourist'sNotes根据每俩个的时间及高度差可计算答案[crayon-688cfcebc3da7521447446/]D.WeirdChess暴力暴力暴力[crayon-688cfcebc3daf913442770/]E.DemiurgesPlayAgain考虑进入某个根,最终会取得子树第几小的叶子[crayon-688cfcebc3db5386404...
Description给一列数,要求支持操作:1.修改某个数的值2.读入l,r,k,询问在[l,r]内选不相交的不超过k个子段,最大的和是多少。InputThefirstlinecontainsintegern(1 ≤ n ≤ 105),showinghowmanynumbersthesequencehas.Thenextlinecontainsnintegersa1, a2, ..., an(|ai| ≤ 500).Thethirdlinecontainsintegerm(1 ≤ m ≤ 105)—thenumberofqueries.Thenextmlinescontainthequeriesintheformat,giveninthestate...
近期评论