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...
「cf534A」Examyy个奇怪的构造TT[crayon-6781699a7647b173889710/]「cf534B」CoveredPathd很小,最大速度就很小,dp即可[crayon-6781699a76484799945434/]「cf534C」Polycarpus'Dice对于每个骰子,得出其它骰子的和sum则它的最小值为A-sum,最大值为A-n+1[crayon-6781699a76489198046821/]「cf534D」Handshakes尽量大的能处理则处理[crayon-6781699a7648e188999706/]「cf534E」BerlandLocalPositioningSystem非...
近期评论